/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.c /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- Ultimate: Cannot open display: This is Ultimate 0.1.25-34f2e62 [2020-07-01 13:13:22,486 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-01 13:13:22,488 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-01 13:13:22,499 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-01 13:13:22,499 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-01 13:13:22,500 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-01 13:13:22,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-01 13:13:22,503 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-01 13:13:22,505 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-01 13:13:22,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-01 13:13:22,506 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-01 13:13:22,507 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-01 13:13:22,507 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-01 13:13:22,508 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-01 13:13:22,509 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-01 13:13:22,510 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-01 13:13:22,511 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-01 13:13:22,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-01 13:13:22,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-01 13:13:22,515 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-01 13:13:22,516 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-01 13:13:22,518 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-01 13:13:22,519 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-01 13:13:22,519 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-01 13:13:22,521 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-01 13:13:22,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-01 13:13:22,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-01 13:13:22,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-01 13:13:22,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-01 13:13:22,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-01 13:13:22,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-01 13:13:22,525 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-01 13:13:22,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-01 13:13:22,526 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-01 13:13:22,527 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-01 13:13:22,527 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-01 13:13:22,528 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-01 13:13:22,528 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-01 13:13:22,528 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-01 13:13:22,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-01 13:13:22,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-01 13:13:22,530 INFO L101 SettingsManager]: Beginning loading settings from /export/starexec/sandbox2/solver/bin/./../termcomp2017.epf [2020-07-01 13:13:22,544 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-01 13:13:22,545 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-01 13:13:22,546 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-01 13:13:22,546 INFO L138 SettingsManager]: * Rewrite not-equals=true [2020-07-01 13:13:22,546 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-01 13:13:22,546 INFO L138 SettingsManager]: * Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:13:22,547 INFO L138 SettingsManager]: * Use SBE=true [2020-07-01 13:13:22,547 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-07-01 13:13:22,547 INFO L138 SettingsManager]: * Use old map elimination=false [2020-07-01 13:13:22,547 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-07-01 13:13:22,547 INFO L138 SettingsManager]: * Buchi interpolant automaton construction strategy=DANDELION [2020-07-01 13:13:22,547 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-07-01 13:13:22,548 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-07-01 13:13:22,548 INFO L138 SettingsManager]: * Construct termination proof for TermComp=true [2020-07-01 13:13:22,548 INFO L138 SettingsManager]: * Command for external solver (GNTA synthesis)=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:12000 [2020-07-01 13:13:22,548 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-01 13:13:22,548 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-07-01 13:13:22,549 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-01 13:13:22,549 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-01 13:13:22,549 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-07-01 13:13:22,549 INFO L138 SettingsManager]: * How to treat unsigned ints differently from normal ones=IGNORE [2020-07-01 13:13:22,549 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-01 13:13:22,549 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-01 13:13:22,550 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-07-01 13:13:22,550 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:13:22,550 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-01 13:13:22,550 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-01 13:13:22,550 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-01 13:13:22,550 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-01 13:13:22,716 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-01 13:13:22,730 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-01 13:13:22,734 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-01 13:13:22,735 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-01 13:13:22,736 INFO L275 PluginConnector]: CDTParser initialized [2020-07-01 13:13:22,736 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:13:22,806 INFO L220 CDTParser]: Created temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_f0FdUE/tmp/0624c8c07e7542aeb96a75a7d6e3528b/FLAGee367d91c [2020-07-01 13:13:23,142 INFO L306 CDTParser]: Found 1 translation units. [2020-07-01 13:13:23,143 INFO L160 CDTParser]: Scanning /export/starexec/sandbox2/benchmark/theBenchmark.c [2020-07-01 13:13:23,143 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2020-07-01 13:13:23,150 INFO L349 CDTParser]: About to delete temporary CDT project at /export/starexec/sandbox2/tmp/BenchExec_run_f0FdUE/tmp/0624c8c07e7542aeb96a75a7d6e3528b/FLAGee367d91c [2020-07-01 13:13:23,571 INFO L357 CDTParser]: Successfully deleted /export/starexec/sandbox2/tmp/BenchExec_run_f0FdUE/tmp/0624c8c07e7542aeb96a75a7d6e3528b [2020-07-01 13:13:23,582 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-01 13:13:23,583 INFO L131 ToolchainWalker]: Walking toolchain with 7 elements. [2020-07-01 13:13:23,584 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-01 13:13:23,585 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-01 13:13:23,588 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-01 13:13:23,589 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,592 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@132d1829 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23, skipping insertion in model container [2020-07-01 13:13:23,593 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,601 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-01 13:13:23,618 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-01 13:13:23,853 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:13:23,866 INFO L203 MainTranslator]: Completed pre-run [2020-07-01 13:13:23,884 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-01 13:13:23,900 INFO L208 MainTranslator]: Completed translation [2020-07-01 13:13:23,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23 WrapperNode [2020-07-01 13:13:23,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-01 13:13:23,901 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-01 13:13:23,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-01 13:13:23,902 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-01 13:13:23,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,920 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,942 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-01 13:13:23,943 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-01 13:13:23,943 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-01 13:13:23,943 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-01 13:13:23,953 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,953 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,955 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,959 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,964 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (1/1) ... [2020-07-01 13:13:23,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-01 13:13:23,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-01 13:13:23,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-01 13:13:23,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-01 13:13:23,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (1/1) ... No working directory specified, using /export/starexec/sandbox2/solver/bin/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:4560 -smt2 -in -t:5000 [2020-07-01 13:13:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-01 13:13:24,040 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-01 13:13:24,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-01 13:13:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-01 13:13:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-01 13:13:24,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-01 13:13:24,345 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-01 13:13:24,346 INFO L295 CfgBuilder]: Removed 8 assume(true) statements. [2020-07-01 13:13:24,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:13:24 BoogieIcfgContainer [2020-07-01 13:13:24,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-01 13:13:24,350 INFO L113 PluginConnector]: ------------------------BlockEncodingV2---------------------------- [2020-07-01 13:13:24,351 INFO L271 PluginConnector]: Initializing BlockEncodingV2... [2020-07-01 13:13:24,353 INFO L275 PluginConnector]: BlockEncodingV2 initialized [2020-07-01 13:13:24,353 INFO L185 PluginConnector]: Executing the observer BlockEncodingObserver from plugin BlockEncodingV2 for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:13:24" (1/1) ... [2020-07-01 13:13:24,369 INFO L313 BlockEncoder]: Initial Icfg 54 locations, 57 edges [2020-07-01 13:13:24,370 INFO L258 BlockEncoder]: Using Remove infeasible edges [2020-07-01 13:13:24,371 INFO L263 BlockEncoder]: Using Maximize final states [2020-07-01 13:13:24,371 INFO L270 BlockEncoder]: Using Minimize states even if more edges are added than removed.=false [2020-07-01 13:13:24,372 INFO L276 BlockEncoder]: Using Minimize states using LBE with the strategy=SINGLE [2020-07-01 13:13:24,374 INFO L296 BlockEncoder]: Using Remove sink states [2020-07-01 13:13:24,375 INFO L171 BlockEncoder]: Using Apply optimizations until nothing changes=true [2020-07-01 13:13:24,375 INFO L179 BlockEncoder]: Using Rewrite not-equals [2020-07-01 13:13:24,402 INFO L185 BlockEncoder]: Using Use SBE [2020-07-01 13:13:24,445 INFO L200 BlockEncoder]: SBE split 29 edges [2020-07-01 13:13:24,451 INFO L70 emoveInfeasibleEdges]: Removed 2 edges and 0 locations because of local infeasibility [2020-07-01 13:13:24,453 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:13:24,485 INFO L100 BaseMinimizeStates]: Removed 14 edges and 7 locations by large block encoding [2020-07-01 13:13:24,488 INFO L70 RemoveSinkStates]: Removed 1 edges and 1 locations by removing sink states [2020-07-01 13:13:24,489 INFO L70 emoveInfeasibleEdges]: Removed 0 edges and 0 locations because of local infeasibility [2020-07-01 13:13:24,490 INFO L71 MaximizeFinalStates]: 0 new accepting states [2020-07-01 13:13:24,490 INFO L100 BaseMinimizeStates]: Removed 0 edges and 0 locations by large block encoding [2020-07-01 13:13:24,491 INFO L70 RemoveSinkStates]: Removed 0 edges and 0 locations by removing sink states [2020-07-01 13:13:24,491 INFO L313 BlockEncoder]: Encoded RCFG 46 locations, 82 edges [2020-07-01 13:13:24,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:13:24 BasicIcfg [2020-07-01 13:13:24,492 INFO L132 PluginConnector]: ------------------------ END BlockEncodingV2---------------------------- [2020-07-01 13:13:24,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-01 13:13:24,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-01 13:13:24,497 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-01 13:13:24,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.07 01:13:23" (1/4) ... [2020-07-01 13:13:24,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf9b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:13:24, skipping insertion in model container [2020-07-01 13:13:24,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (2/4) ... [2020-07-01 13:13:24,498 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf9b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.07 01:13:24, skipping insertion in model container [2020-07-01 13:13:24,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:13:24" (3/4) ... [2020-07-01 13:13:24,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bf9b07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:13:24, skipping insertion in model container [2020-07-01 13:13:24,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:13:24" (4/4) ... [2020-07-01 13:13:24,501 INFO L109 eAbstractionObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:13:24,512 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2020-07-01 13:13:24,520 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 28 error locations. [2020-07-01 13:13:24,534 INFO L251 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2020-07-01 13:13:24,557 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-01 13:13:24,558 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-01 13:13:24,558 INFO L377 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:13:24,558 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:13:24,558 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:13:24,558 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-01 13:13:24,558 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:13:24,559 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-01 13:13:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states. [2020-07-01 13:13:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:13:24,580 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:24,581 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:13:24,581 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:24,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:24,587 INFO L82 PathProgramCache]: Analyzing trace with hash 126408, now seen corresponding path program 1 times [2020-07-01 13:13:24,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:24,598 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846028979] [2020-07-01 13:13:24,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:24,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:24,753 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846028979] [2020-07-01 13:13:24,754 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:24,754 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:24,755 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030299039] [2020-07-01 13:13:24,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:24,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:24,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:24,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:24,778 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 13:13:24,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:24,931 INFO L93 Difference]: Finished difference Result 90 states and 155 transitions. [2020-07-01 13:13:24,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:24,933 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:13:24,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:24,945 INFO L225 Difference]: With dead ends: 90 [2020-07-01 13:13:24,946 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 13:13:24,949 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:24,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 13:13:24,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 13:13:24,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 13:13:24,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 75 transitions. [2020-07-01 13:13:24,990 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 75 transitions. Word has length 3 [2020-07-01 13:13:24,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:24,991 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 75 transitions. [2020-07-01 13:13:24,991 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:24,991 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 75 transitions. [2020-07-01 13:13:24,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:13:24,991 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:24,991 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:13:24,993 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-01 13:13:24,993 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:24,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:24,994 INFO L82 PathProgramCache]: Analyzing trace with hash 126532, now seen corresponding path program 1 times [2020-07-01 13:13:24,994 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:24,994 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192395422] [2020-07-01 13:13:24,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:25,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:25,034 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192395422] [2020-07-01 13:13:25,034 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:25,034 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:25,034 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244297192] [2020-07-01 13:13:25,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:25,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:25,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:25,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,037 INFO L87 Difference]: Start difference. First operand 46 states and 75 transitions. Second operand 3 states. [2020-07-01 13:13:25,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:25,141 INFO L93 Difference]: Finished difference Result 51 states and 75 transitions. [2020-07-01 13:13:25,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:25,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:13:25,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:25,143 INFO L225 Difference]: With dead ends: 51 [2020-07-01 13:13:25,143 INFO L226 Difference]: Without dead ends: 46 [2020-07-01 13:13:25,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2020-07-01 13:13:25,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2020-07-01 13:13:25,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2020-07-01 13:13:25,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 70 transitions. [2020-07-01 13:13:25,150 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 70 transitions. Word has length 3 [2020-07-01 13:13:25,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:25,152 INFO L479 AbstractCegarLoop]: Abstraction has 46 states and 70 transitions. [2020-07-01 13:13:25,152 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:25,152 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 70 transitions. [2020-07-01 13:13:25,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:13:25,152 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:25,152 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:13:25,153 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-01 13:13:25,153 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:25,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:25,153 INFO L82 PathProgramCache]: Analyzing trace with hash 126533, now seen corresponding path program 1 times [2020-07-01 13:13:25,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:25,154 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379204235] [2020-07-01 13:13:25,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:25,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:25,208 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379204235] [2020-07-01 13:13:25,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:25,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:25,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703016581] [2020-07-01 13:13:25,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:25,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:25,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,210 INFO L87 Difference]: Start difference. First operand 46 states and 70 transitions. Second operand 3 states. [2020-07-01 13:13:25,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:25,318 INFO L93 Difference]: Finished difference Result 46 states and 70 transitions. [2020-07-01 13:13:25,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:25,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:13:25,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:25,320 INFO L225 Difference]: With dead ends: 46 [2020-07-01 13:13:25,320 INFO L226 Difference]: Without dead ends: 41 [2020-07-01 13:13:25,321 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-07-01 13:13:25,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2020-07-01 13:13:25,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2020-07-01 13:13:25,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 65 transitions. [2020-07-01 13:13:25,326 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 65 transitions. Word has length 3 [2020-07-01 13:13:25,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:25,326 INFO L479 AbstractCegarLoop]: Abstraction has 41 states and 65 transitions. [2020-07-01 13:13:25,326 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:25,327 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 65 transitions. [2020-07-01 13:13:25,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2020-07-01 13:13:25,327 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:25,327 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2020-07-01 13:13:25,327 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-01 13:13:25,327 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:25,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:25,328 INFO L82 PathProgramCache]: Analyzing trace with hash 126530, now seen corresponding path program 1 times [2020-07-01 13:13:25,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:25,328 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358412541] [2020-07-01 13:13:25,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:25,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:25,362 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358412541] [2020-07-01 13:13:25,362 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:25,362 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:25,362 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149993823] [2020-07-01 13:13:25,363 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:25,363 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:25,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:25,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,363 INFO L87 Difference]: Start difference. First operand 41 states and 65 transitions. Second operand 3 states. [2020-07-01 13:13:25,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:25,470 INFO L93 Difference]: Finished difference Result 41 states and 65 transitions. [2020-07-01 13:13:25,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:25,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2020-07-01 13:13:25,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:25,472 INFO L225 Difference]: With dead ends: 41 [2020-07-01 13:13:25,473 INFO L226 Difference]: Without dead ends: 36 [2020-07-01 13:13:25,473 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2020-07-01 13:13:25,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2020-07-01 13:13:25,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2020-07-01 13:13:25,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 55 transitions. [2020-07-01 13:13:25,478 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 55 transitions. Word has length 3 [2020-07-01 13:13:25,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:25,478 INFO L479 AbstractCegarLoop]: Abstraction has 36 states and 55 transitions. [2020-07-01 13:13:25,478 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:25,479 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 55 transitions. [2020-07-01 13:13:25,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:13:25,479 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:25,479 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:13:25,479 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-01 13:13:25,480 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:25,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:25,480 INFO L82 PathProgramCache]: Analyzing trace with hash 3919663, now seen corresponding path program 1 times [2020-07-01 13:13:25,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:25,480 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19402776] [2020-07-01 13:13:25,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:25,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:25,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:25,514 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19402776] [2020-07-01 13:13:25,515 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:25,515 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:25,515 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695934841] [2020-07-01 13:13:25,515 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:25,516 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:25,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:25,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,516 INFO L87 Difference]: Start difference. First operand 36 states and 55 transitions. Second operand 3 states. [2020-07-01 13:13:25,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:25,596 INFO L93 Difference]: Finished difference Result 36 states and 55 transitions. [2020-07-01 13:13:25,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:25,597 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:13:25,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:25,598 INFO L225 Difference]: With dead ends: 36 [2020-07-01 13:13:25,598 INFO L226 Difference]: Without dead ends: 31 [2020-07-01 13:13:25,598 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-07-01 13:13:25,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-07-01 13:13:25,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-07-01 13:13:25,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions. [2020-07-01 13:13:25,603 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 45 transitions. Word has length 4 [2020-07-01 13:13:25,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:25,603 INFO L479 AbstractCegarLoop]: Abstraction has 31 states and 45 transitions. [2020-07-01 13:13:25,603 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:25,603 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 45 transitions. [2020-07-01 13:13:25,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2020-07-01 13:13:25,604 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:25,604 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2020-07-01 13:13:25,604 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-01 13:13:25,605 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:25,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:25,605 INFO L82 PathProgramCache]: Analyzing trace with hash 3919665, now seen corresponding path program 1 times [2020-07-01 13:13:25,605 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:25,605 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353904427] [2020-07-01 13:13:25,606 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:25,652 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:25,652 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353904427] [2020-07-01 13:13:25,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:25,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:25,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133033148] [2020-07-01 13:13:25,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:25,654 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:25,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:25,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,654 INFO L87 Difference]: Start difference. First operand 31 states and 45 transitions. Second operand 3 states. [2020-07-01 13:13:25,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:25,720 INFO L93 Difference]: Finished difference Result 31 states and 45 transitions. [2020-07-01 13:13:25,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:25,721 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2020-07-01 13:13:25,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:25,721 INFO L225 Difference]: With dead ends: 31 [2020-07-01 13:13:25,721 INFO L226 Difference]: Without dead ends: 26 [2020-07-01 13:13:25,722 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2020-07-01 13:13:25,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2020-07-01 13:13:25,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-01 13:13:25,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2020-07-01 13:13:25,726 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 4 [2020-07-01 13:13:25,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:25,726 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2020-07-01 13:13:25,726 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:25,726 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2020-07-01 13:13:25,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:13:25,727 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:25,727 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:13:25,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-01 13:13:25,727 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:25,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:25,728 INFO L82 PathProgramCache]: Analyzing trace with hash 121507999, now seen corresponding path program 1 times [2020-07-01 13:13:25,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:25,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812141441] [2020-07-01 13:13:25,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:25,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:25,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:25,763 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812141441] [2020-07-01 13:13:25,763 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:25,763 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:25,763 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766888844] [2020-07-01 13:13:25,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:25,764 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:25,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:25,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,765 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand 3 states. [2020-07-01 13:13:25,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:25,819 INFO L93 Difference]: Finished difference Result 26 states and 35 transitions. [2020-07-01 13:13:25,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:25,820 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:13:25,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:25,821 INFO L225 Difference]: With dead ends: 26 [2020-07-01 13:13:25,821 INFO L226 Difference]: Without dead ends: 22 [2020-07-01 13:13:25,822 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-01 13:13:25,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-01 13:13:25,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-01 13:13:25,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-07-01 13:13:25,825 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 5 [2020-07-01 13:13:25,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:25,826 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-07-01 13:13:25,826 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:25,826 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2020-07-01 13:13:25,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-07-01 13:13:25,826 INFO L414 BasicCegarLoop]: Found error trace [2020-07-01 13:13:25,826 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-07-01 13:13:25,827 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-01 13:13:25,827 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr24REQUIRES_VIOLATION, ULTIMATE.startErr22REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr25REQUIRES_VIOLATION, ULTIMATE.startErr21REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr23REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr26REQUIRES_VIOLATION, ULTIMATE.startErr9REQUIRES_VIOLATION, ULTIMATE.startErr27REQUIRES_VIOLATION, ULTIMATE.startErr8REQUIRES_VIOLATION, ULTIMATE.startErr12REQUIRES_VIOLATION, ULTIMATE.startErr11REQUIRES_VIOLATION, ULTIMATE.startErr10REQUIRES_VIOLATION, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr13REQUIRES_VIOLATION, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr20REQUIRES_VIOLATION, ULTIMATE.startErr19REQUIRES_VIOLATION, ULTIMATE.startErr18REQUIRES_VIOLATION]=== [2020-07-01 13:13:25,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:25,827 INFO L82 PathProgramCache]: Analyzing trace with hash 121508001, now seen corresponding path program 1 times [2020-07-01 13:13:25,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:25,828 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668452556] [2020-07-01 13:13:25,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:25,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:25,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:25,860 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668452556] [2020-07-01 13:13:25,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:25,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:25,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306032020] [2020-07-01 13:13:25,861 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-01 13:13:25,861 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:25,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:25,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,862 INFO L87 Difference]: Start difference. First operand 22 states and 27 transitions. Second operand 3 states. [2020-07-01 13:13:25,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:25,897 INFO L93 Difference]: Finished difference Result 22 states and 27 transitions. [2020-07-01 13:13:25,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:25,898 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-07-01 13:13:25,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-01 13:13:25,898 INFO L225 Difference]: With dead ends: 22 [2020-07-01 13:13:25,898 INFO L226 Difference]: Without dead ends: 0 [2020-07-01 13:13:25,899 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:25,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-01 13:13:25,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-01 13:13:25,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-01 13:13:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-01 13:13:25,900 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 5 [2020-07-01 13:13:25,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-01 13:13:25,900 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-01 13:13:25,901 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-01 13:13:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-01 13:13:25,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-01 13:13:25,901 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-01 13:13:25,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-01 13:13:25,970 INFO L268 CegarLoopResult]: For program point L19(line 19) no Hoare annotation was computed. [2020-07-01 13:13:25,970 INFO L268 CegarLoopResult]: For program point L15(line 15) no Hoare annotation was computed. [2020-07-01 13:13:25,971 INFO L268 CegarLoopResult]: For program point L15-1(lines 15 18) no Hoare annotation was computed. [2020-07-01 13:13:25,971 INFO L264 CegarLoopResult]: At program point L15-3(lines 14 18) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:13:25,971 INFO L268 CegarLoopResult]: For program point L11(line 11) no Hoare annotation was computed. [2020-07-01 13:13:25,971 INFO L268 CegarLoopResult]: For program point L15-4(lines 15 18) no Hoare annotation was computed. [2020-07-01 13:13:25,971 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr25REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:13:25,972 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-01 13:13:25,972 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr27REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:13:25,972 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-01 13:13:25,972 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr21REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:13:25,972 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr23REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:13:25,972 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr17REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:13:25,972 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr19REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:13:25,972 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr13REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:13:25,973 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr15REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:13:25,973 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr9REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:13:25,973 INFO L268 CegarLoopResult]: For program point L16(line 16) no Hoare annotation was computed. [2020-07-01 13:13:25,973 INFO L268 CegarLoopResult]: For program point L16-1(line 16) no Hoare annotation was computed. [2020-07-01 13:13:25,973 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr11REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:13:25,973 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr5REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:13:25,974 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr7REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:13:25,974 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr1REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:13:25,974 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr3REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:13:25,974 INFO L268 CegarLoopResult]: For program point L17(line 17) no Hoare annotation was computed. [2020-07-01 13:13:25,974 INFO L268 CegarLoopResult]: For program point L17-1(line 17) no Hoare annotation was computed. [2020-07-01 13:13:25,974 INFO L268 CegarLoopResult]: For program point L13(lines 13 20) no Hoare annotation was computed. [2020-07-01 13:13:25,975 INFO L264 CegarLoopResult]: At program point L13-2(lines 12 20) the Hoare annotation is: (and (= 1 (select |#valid| ULTIMATE.start_test_fun_~c~0.base)) (= 4 (select |#length| ULTIMATE.start_test_fun_~c~0.base)) (= 1 (select |#valid| ULTIMATE.start_test_fun_~x_ref~0.base)) (= ULTIMATE.start_test_fun_~y_ref~0.offset 0) (= 4 (select |#length| ULTIMATE.start_test_fun_~x_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~c~0.offset) (<= 1 |#StackHeapBarrier|) (= (select |#length| ULTIMATE.start_test_fun_~y_ref~0.base) 4) (= 1 (select |#valid| ULTIMATE.start_test_fun_~y_ref~0.base)) (= 0 ULTIMATE.start_test_fun_~x_ref~0.offset)) [2020-07-01 13:13:25,975 INFO L268 CegarLoopResult]: For program point L13-3(lines 13 20) no Hoare annotation was computed. [2020-07-01 13:13:25,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr26REQUIRES_VIOLATION(line 21) no Hoare annotation was computed. [2020-07-01 13:13:25,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr22REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:13:25,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr24REQUIRES_VIOLATION(line 19) no Hoare annotation was computed. [2020-07-01 13:13:25,975 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr18REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:13:25,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr20REQUIRES_VIOLATION(line 17) no Hoare annotation was computed. [2020-07-01 13:13:25,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr14REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:13:25,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr16REQUIRES_VIOLATION(line 16) no Hoare annotation was computed. [2020-07-01 13:13:25,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr10REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:13:25,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr12REQUIRES_VIOLATION(line 15) no Hoare annotation was computed. [2020-07-01 13:13:25,976 INFO L268 CegarLoopResult]: For program point L14(line 14) no Hoare annotation was computed. [2020-07-01 13:13:25,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr6REQUIRES_VIOLATION(line 13) no Hoare annotation was computed. [2020-07-01 13:13:25,976 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr8REQUIRES_VIOLATION(line 14) no Hoare annotation was computed. [2020-07-01 13:13:25,977 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-01 13:13:25,977 INFO L268 CegarLoopResult]: For program point L10-1(line 10) no Hoare annotation was computed. [2020-07-01 13:13:25,977 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr2REQUIRES_VIOLATION(line 11) no Hoare annotation was computed. [2020-07-01 13:13:25,977 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr4REQUIRES_VIOLATION(line 12) no Hoare annotation was computed. [2020-07-01 13:13:25,977 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0REQUIRES_VIOLATION(line 10) no Hoare annotation was computed. [2020-07-01 13:13:25,980 INFO L308 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2020-07-01 13:13:25,989 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:25,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:25,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:25,991 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:25,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:25,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:25,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:25,998 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:25,999 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:26,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:26,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:13:26 BasicIcfg [2020-07-01 13:13:26,004 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-01 13:13:26,005 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-07-01 13:13:26,005 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-07-01 13:13:26,008 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-07-01 13:13:26,009 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:26,009 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.07 01:13:23" (1/5) ... [2020-07-01 13:13:26,009 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@552c6e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:13:26, skipping insertion in model container [2020-07-01 13:13:26,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:26,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.07 01:13:23" (2/5) ... [2020-07-01 13:13:26,010 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@552c6e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.07 01:13:26, skipping insertion in model container [2020-07-01 13:13:26,010 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:26,010 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.07 01:13:24" (3/5) ... [2020-07-01 13:13:26,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@552c6e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:13:26, skipping insertion in model container [2020-07-01 13:13:26,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:26,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.blockencoding CFG 01.07 01:13:24" (4/5) ... [2020-07-01 13:13:26,011 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@552c6e9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.07 01:13:26, skipping insertion in model container [2020-07-01 13:13:26,011 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-07-01 13:13:26,011 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.07 01:13:26" (5/5) ... [2020-07-01 13:13:26,013 INFO L371 chiAutomizerObserver]: Analyzing ICFG theBenchmark.c_BEv2 [2020-07-01 13:13:26,034 INFO L356 BuchiCegarLoop]: Interprodecural is true [2020-07-01 13:13:26,034 INFO L357 BuchiCegarLoop]: Hoare is true [2020-07-01 13:13:26,034 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-07-01 13:13:26,034 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-01 13:13:26,034 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-01 13:13:26,035 INFO L361 BuchiCegarLoop]: Difference is false [2020-07-01 13:13:26,035 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-01 13:13:26,035 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-07-01 13:13:26,038 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 13:13:26,045 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 13:13:26,045 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:13:26,045 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:13:26,051 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:13:26,051 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:26,051 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2020-07-01 13:13:26,052 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states. [2020-07-01 13:13:26,054 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2020-07-01 13:13:26,054 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-07-01 13:13:26,054 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-07-01 13:13:26,055 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-07-01 13:13:26,055 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2020-07-01 13:13:26,060 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRYtrue [95] ULTIMATE.startENTRY-->L-1: Formula: (and (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= |v_#valid_1| (store |v_#valid_2| 0 0)) (= |v_#NULL.offset_1| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_2|} OutVars{#NULL.offset=|v_#NULL.offset_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #NULL.base=|v_#NULL.base_1|, #valid=|v_#valid_1|} AuxVars[] AssignedVars[#valid, #NULL.offset, #NULL.base] 15#L-1true [173] L-1-->L10: Formula: (let ((.cse1 (store |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 1))) (and (> 0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (> 0 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= |v_#length_1| (store (store (store |v_#length_4| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc1.base_1| 4) |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 4)) (= (store .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1| 1) |v_#valid_3|) (= v_ULTIMATE.start_test_fun_~y_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|) (= v_ULTIMATE.start_test_fun_~c~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|) (= |v_ULTIMATE.start_test_fun_#in~y_1| |v_ULTIMATE.start_main_#t~nondet11_1|) (= v_ULTIMATE.start_test_fun_~x_ref~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|) (= v_ULTIMATE.start_test_fun_~y_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= v_ULTIMATE.start_test_fun_~x_1 |v_ULTIMATE.start_test_fun_#in~x_1|) (= 0 (select .cse0 |v_ULTIMATE.start_test_fun_#t~malloc2.base_1|)) (< |v_ULTIMATE.start_test_fun_#t~malloc0.base_1| 0) (= |v_ULTIMATE.start_test_fun_#in~x_1| |v_ULTIMATE.start_main_#t~nondet10_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|) (= 0 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (= 0 (select |v_#valid_6| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|)) (= v_ULTIMATE.start_test_fun_~x_ref~0.base_1 |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= v_ULTIMATE.start_test_fun_~c~0.offset_1 |v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|) (< |v_#StackHeapBarrier_2| |v_ULTIMATE.start_test_fun_#t~malloc0.base_1|) (= 0 (select .cse1 |v_ULTIMATE.start_test_fun_#t~malloc1.base_1|)) (= v_ULTIMATE.start_test_fun_~y_1 |v_ULTIMATE.start_test_fun_#in~y_1|)))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_2|, #length=|v_#length_4|, #valid=|v_#valid_6|} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_1, ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_1, ULTIMATE.start_main_#t~nondet10=|v_ULTIMATE.start_main_#t~nondet10_1|, ULTIMATE.start_main_#t~nondet11=|v_ULTIMATE.start_main_#t~nondet11_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_1, ULTIMATE.start_test_fun_#t~malloc1.offset=|v_ULTIMATE.start_test_fun_#t~malloc1.offset_1|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_1|, ULTIMATE.start_test_fun_#t~mem9=|v_ULTIMATE.start_test_fun_#t~mem9_1|, ULTIMATE.start_test_fun_#t~mem6=|v_ULTIMATE.start_test_fun_#t~mem6_1|, ULTIMATE.start_test_fun_#t~mem7=|v_ULTIMATE.start_test_fun_#t~mem7_1|, ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_1|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_1|, ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_1|, ULTIMATE.start_test_fun_#res=|v_ULTIMATE.start_test_fun_#res_1|, #length=|v_#length_1|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_1, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_1, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_1, ULTIMATE.start_test_fun_#t~malloc0.offset=|v_ULTIMATE.start_test_fun_#t~malloc0.offset_1|, ULTIMATE.start_test_fun_#in~y=|v_ULTIMATE.start_test_fun_#in~y_1|, ULTIMATE.start_test_fun_#in~x=|v_ULTIMATE.start_test_fun_#in~x_1|, ULTIMATE.start_test_fun_#t~malloc1.base=|v_ULTIMATE.start_test_fun_#t~malloc1.base_1|, #StackHeapBarrier=|v_#StackHeapBarrier_2|, ULTIMATE.start_test_fun_#t~malloc2.base=|v_ULTIMATE.start_test_fun_#t~malloc2.base_1|, ULTIMATE.start_test_fun_#t~malloc2.offset=|v_ULTIMATE.start_test_fun_#t~malloc2.offset_1|, ULTIMATE.start_main_#t~ret12=|v_ULTIMATE.start_main_#t~ret12_1|, ULTIMATE.start_test_fun_#t~malloc0.base=|v_ULTIMATE.start_test_fun_#t~malloc0.base_1|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_1|, #valid=|v_#valid_3|, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_1, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_1} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_~y, ULTIMATE.start_test_fun_~x, ULTIMATE.start_main_#t~nondet10, ULTIMATE.start_main_#t~nondet11, ULTIMATE.start_test_fun_~x_ref~0.offset, ULTIMATE.start_test_fun_#t~malloc1.offset, ULTIMATE.start_test_fun_#t~mem8, ULTIMATE.start_test_fun_#t~mem9, ULTIMATE.start_test_fun_#t~mem6, ULTIMATE.start_test_fun_#t~mem7, ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5, ULTIMATE.start_test_fun_#t~mem3, ULTIMATE.start_test_fun_#res, #length, ULTIMATE.start_test_fun_~y_ref~0.base, ULTIMATE.start_test_fun_~x_ref~0.base, ULTIMATE.start_test_fun_~c~0.offset, ULTIMATE.start_test_fun_#t~malloc0.offset, ULTIMATE.start_test_fun_#in~y, ULTIMATE.start_test_fun_#in~x, ULTIMATE.start_test_fun_#t~malloc1.base, ULTIMATE.start_test_fun_#t~malloc2.base, ULTIMATE.start_test_fun_#t~malloc2.offset, ULTIMATE.start_main_#t~ret12, ULTIMATE.start_test_fun_#t~malloc0.base, ULTIMATE.start_main_#res, #valid, ULTIMATE.start_test_fun_~y_ref~0.offset, ULTIMATE.start_test_fun_~c~0.base] 17#L10true [79] L10-->L10-1: Formula: (and (= 1 (select |v_#valid_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 4) (select |v_#length_5| v_ULTIMATE.start_test_fun_~x_ref~0.base_3)) (= (store |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3 (store (select |v_#memory_int_2| v_ULTIMATE.start_test_fun_~x_ref~0.base_3) v_ULTIMATE.start_test_fun_~x_ref~0.offset_3 v_ULTIMATE.start_test_fun_~x_3)) |v_#memory_int_1|)) InVars {ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_2|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} OutVars{ULTIMATE.start_test_fun_~x=v_ULTIMATE.start_test_fun_~x_3, #valid=|v_#valid_7|, #memory_int=|v_#memory_int_1|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_3, #length=|v_#length_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_3} AuxVars[] AssignedVars[#memory_int] 34#L10-1true [122] L10-1-->L11: Formula: (and (= |v_#memory_int_3| (store |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3 (store (select |v_#memory_int_4| v_ULTIMATE.start_test_fun_~y_ref~0.base_3) v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 v_ULTIMATE.start_test_fun_~y_3))) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_3) (= 1 (select |v_#valid_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_3)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_3 4) (select |v_#length_7| v_ULTIMATE.start_test_fun_~y_ref~0.base_3))) InVars {ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_4|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} OutVars{ULTIMATE.start_test_fun_~y=v_ULTIMATE.start_test_fun_~y_3, #valid=|v_#valid_9|, #memory_int=|v_#memory_int_3|, #length=|v_#length_7|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_3, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_3} AuxVars[] AssignedVars[#memory_int] 39#L11true [96] L11-->L13-2: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~c~0.offset_3) (<= (+ v_ULTIMATE.start_test_fun_~c~0.offset_3 4) (select |v_#length_9| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= 1 (select |v_#valid_11| v_ULTIMATE.start_test_fun_~c~0.base_3)) (= (store |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3 (store (select |v_#memory_int_6| v_ULTIMATE.start_test_fun_~c~0.base_3) v_ULTIMATE.start_test_fun_~c~0.offset_3 0)) |v_#memory_int_5|)) InVars {#memory_int=|v_#memory_int_6|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} OutVars{#memory_int=|v_#memory_int_5|, #length=|v_#length_9|, ULTIMATE.start_test_fun_~c~0.offset=v_ULTIMATE.start_test_fun_~c~0.offset_3, ULTIMATE.start_test_fun_~c~0.base=v_ULTIMATE.start_test_fun_~c~0.base_3, #valid=|v_#valid_11|} AuxVars[] AssignedVars[#memory_int] 40#L13-2true [2020-07-01 13:13:26,061 INFO L796 eck$LassoCheckResult]: Loop: 40#L13-2true [130] L13-2-->L13: Formula: (and (= 1 (select |v_#valid_13| v_ULTIMATE.start_test_fun_~x_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_5) (= |v_ULTIMATE.start_test_fun_#t~mem3_2| (select (select |v_#memory_int_7| v_ULTIMATE.start_test_fun_~x_ref~0.base_6) v_ULTIMATE.start_test_fun_~x_ref~0.offset_5)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_5 4) (select |v_#length_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_6))) InVars {#memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6, #valid=|v_#valid_13|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_2|, #valid=|v_#valid_13|, #memory_int=|v_#memory_int_7|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_5, #length=|v_#length_11|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_6} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 45#L13true [134] L13-->L14: Formula: (< 0 |v_ULTIMATE.start_test_fun_#t~mem3_6|) InVars {ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_6|} OutVars{ULTIMATE.start_test_fun_#t~mem3=|v_ULTIMATE.start_test_fun_#t~mem3_5|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem3] 23#L14true [84] L14-->L15-3: Formula: (and (= 1 (select |v_#valid_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_5) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 4) (select |v_#length_13| v_ULTIMATE.start_test_fun_~y_ref~0.base_6)) (= |v_#memory_int_8| (store |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_6 (store (select |v_#memory_int_9| v_ULTIMATE.start_test_fun_~y_ref~0.base_6) v_ULTIMATE.start_test_fun_~y_ref~0.offset_5 0)))) InVars {#memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} OutVars{#memory_int=|v_#memory_int_8|, #length=|v_#length_13|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_6, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_5, #valid=|v_#valid_15|} AuxVars[] AssignedVars[#memory_int] 43#L15-3true [103] L15-3-->L15: Formula: (and (= 1 (select |v_#valid_17| v_ULTIMATE.start_test_fun_~y_ref~0.base_9)) (<= 0 v_ULTIMATE.start_test_fun_~y_ref~0.offset_7) (= |v_ULTIMATE.start_test_fun_#t~mem4_2| (select (select |v_#memory_int_10| v_ULTIMATE.start_test_fun_~y_ref~0.base_9) v_ULTIMATE.start_test_fun_~y_ref~0.offset_7)) (<= (+ v_ULTIMATE.start_test_fun_~y_ref~0.offset_7 4) (select |v_#length_15| v_ULTIMATE.start_test_fun_~y_ref~0.base_9))) InVars {#memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7, #valid=|v_#valid_17|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_2|, #valid=|v_#valid_17|, #memory_int=|v_#memory_int_10|, #length=|v_#length_15|, ULTIMATE.start_test_fun_~y_ref~0.base=v_ULTIMATE.start_test_fun_~y_ref~0.base_9, ULTIMATE.start_test_fun_~y_ref~0.offset=v_ULTIMATE.start_test_fun_~y_ref~0.offset_7} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4] 25#L15true [88] L15-->L15-1: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_7) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_7 4) (select |v_#length_17| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= 1 (select |v_#valid_19| v_ULTIMATE.start_test_fun_~x_ref~0.base_9)) (= |v_ULTIMATE.start_test_fun_#t~mem5_2| (select (select |v_#memory_int_11| v_ULTIMATE.start_test_fun_~x_ref~0.base_9) v_ULTIMATE.start_test_fun_~x_ref~0.offset_7))) InVars {#memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9, #valid=|v_#valid_19|} OutVars{ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_2|, #valid=|v_#valid_19|, #memory_int=|v_#memory_int_11|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_7, #length=|v_#length_17|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_9} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem5] 47#L15-1true [157] L15-1-->L15-4: Formula: (>= |v_ULTIMATE.start_test_fun_#t~mem4_4| |v_ULTIMATE.start_test_fun_#t~mem5_4|) InVars {ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_4|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_4|} OutVars{ULTIMATE.start_test_fun_#t~mem4=|v_ULTIMATE.start_test_fun_#t~mem4_3|, ULTIMATE.start_test_fun_#t~mem5=|v_ULTIMATE.start_test_fun_#t~mem5_3|} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem4, ULTIMATE.start_test_fun_#t~mem5] 41#L15-4true [99] L15-4-->L19: Formula: (and (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_9 4) (select |v_#length_27| v_ULTIMATE.start_test_fun_~x_ref~0.base_12)) (= (select (select |v_#memory_int_18| v_ULTIMATE.start_test_fun_~x_ref~0.base_12) v_ULTIMATE.start_test_fun_~x_ref~0.offset_9) |v_ULTIMATE.start_test_fun_#t~mem8_2|) (= 1 (select |v_#valid_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_12))) InVars {#memory_int=|v_#memory_int_18|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_27|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12, #valid=|v_#valid_29|} OutVars{#valid=|v_#valid_29|, #memory_int=|v_#memory_int_18|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_9, #length=|v_#length_27|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_2|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_12} AuxVars[] AssignedVars[ULTIMATE.start_test_fun_#t~mem8] 33#L19true [235] L19-->L13-2: Formula: (and (= (store |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_18 (store (select |v_#memory_int_29| v_ULTIMATE.start_test_fun_~x_ref~0.base_18) v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 (+ |v_ULTIMATE.start_test_fun_#t~mem8_6| (- 1)))) |v_#memory_int_28|) (= 1 (select |v_#valid_48| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= (+ v_ULTIMATE.start_test_fun_~x_ref~0.offset_13 4) (select |v_#length_38| v_ULTIMATE.start_test_fun_~x_ref~0.base_18)) (<= 0 v_ULTIMATE.start_test_fun_~x_ref~0.offset_13)) InVars {#valid=|v_#valid_48|, #memory_int=|v_#memory_int_29|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_6|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} OutVars{#valid=|v_#valid_48|, #memory_int=|v_#memory_int_28|, ULTIMATE.start_test_fun_~x_ref~0.offset=v_ULTIMATE.start_test_fun_~x_ref~0.offset_13, #length=|v_#length_38|, ULTIMATE.start_test_fun_#t~mem8=|v_ULTIMATE.start_test_fun_#t~mem8_5|, ULTIMATE.start_test_fun_~x_ref~0.base=v_ULTIMATE.start_test_fun_~x_ref~0.base_18} AuxVars[] AssignedVars[#memory_int, ULTIMATE.start_test_fun_#t~mem8] 40#L13-2true [2020-07-01 13:13:26,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:26,063 INFO L82 PathProgramCache]: Analyzing trace with hash 121597286, now seen corresponding path program 1 times [2020-07-01 13:13:26,063 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:26,063 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738489408] [2020-07-01 13:13:26,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:26,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-01 13:13:26,084 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-01 13:13:26,084 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738489408] [2020-07-01 13:13:26,084 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-01 13:13:26,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-01 13:13:26,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846055891] [2020-07-01 13:13:26,085 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-07-01 13:13:26,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-01 13:13:26,086 INFO L82 PathProgramCache]: Analyzing trace with hash -1706221499, now seen corresponding path program 1 times [2020-07-01 13:13:26,086 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-01 13:13:26,086 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087110196] [2020-07-01 13:13:26,086 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-01 13:13:26,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:13:26,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-01 13:13:26,132 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-01 13:13:26,258 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-01 13:13:26,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-01 13:13:26,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-01 13:13:26,259 INFO L87 Difference]: Start difference. First operand 46 states. Second operand 3 states. [2020-07-01 13:13:26,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-01 13:13:26,377 INFO L93 Difference]: Finished difference Result 46 states and 75 transitions. [2020-07-01 13:13:26,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-01 13:13:26,380 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.AssertionError: unknown kind of automaton at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) at de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.toString(AutomatonDefinitionPrinter.java:186) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.TermcompProofBenchmark.reportFiniteModule(TermcompProofBenchmark.java:61) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.refineFinite(BuchiCegarLoop.java:978) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:532) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:380) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-07-01 13:13:26,384 INFO L168 Benchmark]: Toolchain (without parser) took 2800.21 ms. Allocated memory was 649.6 MB in the beginning and 755.5 MB in the end (delta: 105.9 MB). Free memory was 561.5 MB in the beginning and 710.0 MB in the end (delta: -148.4 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:13:26,385 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:13:26,385 INFO L168 Benchmark]: CACSL2BoogieTranslator took 316.58 ms. Allocated memory was 649.6 MB in the beginning and 690.5 MB in the end (delta: 40.9 MB). Free memory was 561.5 MB in the beginning and 652.5 MB in the end (delta: -90.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:26,386 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.10 ms. Allocated memory is still 690.5 MB. Free memory was 652.5 MB in the beginning and 651.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:26,387 INFO L168 Benchmark]: Boogie Preprocessor took 24.66 ms. Allocated memory is still 690.5 MB. Free memory was 651.1 MB in the beginning and 648.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:26,387 INFO L168 Benchmark]: RCFGBuilder took 382.32 ms. Allocated memory is still 690.5 MB. Free memory was 648.4 MB in the beginning and 621.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:26,388 INFO L168 Benchmark]: BlockEncodingV2 took 141.76 ms. Allocated memory is still 690.5 MB. Free memory was 621.9 MB in the beginning and 609.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:26,388 INFO L168 Benchmark]: TraceAbstraction took 1510.73 ms. Allocated memory is still 690.5 MB. Free memory was 608.5 MB in the beginning and 432.7 MB in the end (delta: 175.8 MB). Peak memory consumption was 175.8 MB. Max. memory is 50.3 GB. [2020-07-01 13:13:26,389 INFO L168 Benchmark]: BuchiAutomizer took 377.21 ms. Allocated memory was 690.5 MB in the beginning and 755.5 MB in the end (delta: 65.0 MB). Free memory was 432.7 MB in the beginning and 710.0 MB in the end (delta: -277.3 MB). There was no memory consumed. Max. memory is 50.3 GB. [2020-07-01 13:13:26,392 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.blockencoding: - StatisticsResult: Initial Icfg 54 locations, 57 edges - StatisticsResult: Encoded RCFG 46 locations, 82 edges * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 649.6 MB. Free memory is still 583.2 MB. There was no memory consumed. Max. memory is 50.3 GB. * CACSL2BoogieTranslator took 316.58 ms. Allocated memory was 649.6 MB in the beginning and 690.5 MB in the end (delta: 40.9 MB). Free memory was 561.5 MB in the beginning and 652.5 MB in the end (delta: -90.9 MB). Peak memory consumption was 28.4 MB. Max. memory is 50.3 GB. * Boogie Procedure Inliner took 41.10 ms. Allocated memory is still 690.5 MB. Free memory was 652.5 MB in the beginning and 651.1 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 50.3 GB. * Boogie Preprocessor took 24.66 ms. Allocated memory is still 690.5 MB. Free memory was 651.1 MB in the beginning and 648.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 50.3 GB. * RCFGBuilder took 382.32 ms. Allocated memory is still 690.5 MB. Free memory was 648.4 MB in the beginning and 621.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 50.3 GB. * BlockEncodingV2 took 141.76 ms. Allocated memory is still 690.5 MB. Free memory was 621.9 MB in the beginning and 609.8 MB in the end (delta: 12.1 MB). Peak memory consumption was 12.1 MB. Max. memory is 50.3 GB. * TraceAbstraction took 1510.73 ms. Allocated memory is still 690.5 MB. Free memory was 608.5 MB in the beginning and 432.7 MB in the end (delta: 175.8 MB). Peak memory consumption was 175.8 MB. Max. memory is 50.3 GB. * BuchiAutomizer took 377.21 ms. Allocated memory was 690.5 MB in the beginning and 755.5 MB in the end (delta: 65.0 MB). Free memory was 432.7 MB in the beginning and 710.0 MB in the end (delta: -277.3 MB). There was no memory consumed. Max. memory is 50.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 10]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 11]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 19]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 13]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 12]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 21]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 14]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 16]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 17]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 28 specifications checked. All of them hold - InvariantResult [Line: 12]: Loop Invariant [2020-07-01 13:13:26,402 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:26,403 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,404 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:26,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - InvariantResult [Line: 14]: Loop Invariant [2020-07-01 13:13:26,405 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:26,406 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-07-01 13:13:26,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2020-07-01 13:13:26,407 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((1 == \valid[c] && 4 == unknown-#length-unknown[c]) && 1 == \valid[x_ref]) && y_ref == 0) && 4 == unknown-#length-unknown[x_ref]) && 0 == c) && 1 <= unknown-#StackHeapBarrier-unknown) && unknown-#length-unknown[y_ref] == 4) && 1 == \valid[y_ref]) && 0 == x_ref - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 46 locations, 28 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 1.3s, OverallIterations: 8, TraceHistogramMax: 1, AutomataDifference: 0.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 45 SDtfs, 370 SDslu, 4 SDs, 0 SdLazy, 349 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=46occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 2 LocationsWithAnnotation, 2 PreInvPairs, 4 NumberOfFragments, 86 HoareAnnotationTreeSize, 2 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 2 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 22 ConstructedInterpolants, 0 QuantifiedInterpolants, 314 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: AssertionError: unknown kind of automaton de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: AssertionError: unknown kind of automaton: de.uni_freiburg.informatik.ultimate.automata.AutomatonDefinitionPrinter.printAutomaton(AutomatonDefinitionPrinter.java:349) RESULT: Ultimate could not prove your program: Toolchain returned no result. !SESSION 2020-07-01 13:13:20.303 ----------------------------------------------- eclipse.buildId=unknown java.version=1.8.0_242 java.vendor=Oracle Corporation BootLoader constants: OS=linux, ARCH=x86_64, WS=gtk, NL=en_US Framework arguments: -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -i /export/starexec/sandbox2/benchmark/theBenchmark.c Command-line arguments: -os linux -ws gtk -arch x86_64 -consoleLog -data @user.home/.ultimate -tc ./../AutomizerAndBuchiAutomizerCInlineWithBlockEncoding.xml -s ./../termcomp2017.epf -data /export/starexec/sandbox2/tmp/BenchExec_run_f0FdUE/tmp -i /export/starexec/sandbox2/benchmark/theBenchmark.c !ENTRY org.eclipse.core.resources 2 10035 2020-07-01 13:13:26.632 !MESSAGE The workspace will exit with unsaved changes in this session. Received shutdown request... Ultimate: GTK+ Version Check