./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 906a4fb5 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 0233d496bfaf5cb1311bfa260a57f41458184795 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-906a4fb [2020-10-19 18:39:30,361 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-19 18:39:30,364 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-19 18:39:30,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-19 18:39:30,392 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-19 18:39:30,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-19 18:39:30,399 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-19 18:39:30,404 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-19 18:39:30,408 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-19 18:39:30,412 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-19 18:39:30,413 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-19 18:39:30,417 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-19 18:39:30,417 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-19 18:39:30,419 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-19 18:39:30,421 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-19 18:39:30,423 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-19 18:39:30,425 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-19 18:39:30,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-19 18:39:30,431 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-19 18:39:30,434 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-19 18:39:30,438 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-19 18:39:30,442 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-19 18:39:30,445 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-19 18:39:30,445 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-19 18:39:30,448 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-19 18:39:30,448 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-19 18:39:30,448 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-19 18:39:30,449 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-19 18:39:30,450 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-19 18:39:30,451 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-19 18:39:30,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-19 18:39:30,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-19 18:39:30,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-19 18:39:30,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-19 18:39:30,455 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-19 18:39:30,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-19 18:39:30,456 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-19 18:39:30,456 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-19 18:39:30,457 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-19 18:39:30,458 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-19 18:39:30,458 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-19 18:39:30,459 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2020-10-19 18:39:30,486 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-19 18:39:30,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-19 18:39:30,488 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-19 18:39:30,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-19 18:39:30,489 INFO L138 SettingsManager]: * Use SBE=true [2020-10-19 18:39:30,489 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-19 18:39:30,490 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-19 18:39:30,490 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-19 18:39:30,490 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-19 18:39:30,490 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-19 18:39:30,491 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-19 18:39:30,491 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-19 18:39:30,491 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-19 18:39:30,491 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-19 18:39:30,492 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-19 18:39:30,492 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-19 18:39:30,492 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-19 18:39:30,493 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-19 18:39:30,493 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-19 18:39:30,493 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-19 18:39:30,493 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-19 18:39:30,494 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-19 18:39:30,494 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-19 18:39:30,494 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-19 18:39:30,495 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-19 18:39:30,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-19 18:39:30,495 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-19 18:39:30,496 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-19 18:39:30,496 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-19 18:39:30,497 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-19 18:39:30,497 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0233d496bfaf5cb1311bfa260a57f41458184795 [2020-10-19 18:39:30,826 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-19 18:39:30,843 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-19 18:39:30,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-19 18:39:30,849 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-19 18:39:30,851 INFO L275 PluginConnector]: CDTParser initialized [2020-10-19 18:39:30,852 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-10-19 18:39:30,931 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baa7fa8a1/ef583a9fff2d427080122ca4e0676541/FLAG6cf467e5f [2020-10-19 18:39:31,309 INFO L306 CDTParser]: Found 1 translation units. [2020-10-19 18:39:31,310 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2020-10-19 18:39:31,315 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baa7fa8a1/ef583a9fff2d427080122ca4e0676541/FLAG6cf467e5f [2020-10-19 18:39:31,678 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/baa7fa8a1/ef583a9fff2d427080122ca4e0676541 [2020-10-19 18:39:31,682 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-19 18:39:31,687 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-19 18:39:31,688 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-19 18:39:31,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-19 18:39:31,693 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-19 18:39:31,694 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:31,698 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c422bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31, skipping insertion in model container [2020-10-19 18:39:31,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:31,708 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-19 18:39:31,724 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-19 18:39:31,937 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:39:31,953 INFO L203 MainTranslator]: Completed pre-run [2020-10-19 18:39:31,976 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-19 18:39:31,994 INFO L208 MainTranslator]: Completed translation [2020-10-19 18:39:31,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31 WrapperNode [2020-10-19 18:39:31,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-19 18:39:31,996 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-19 18:39:31,997 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-19 18:39:31,997 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-19 18:39:32,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:32,020 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:32,048 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-19 18:39:32,049 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-19 18:39:32,049 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-19 18:39:32,049 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-19 18:39:32,122 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:32,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:32,128 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:32,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:32,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:32,137 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:32,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (1/1) ... [2020-10-19 18:39:32,141 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-19 18:39:32,142 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-19 18:39:32,142 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-19 18:39:32,142 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-19 18:39:32,143 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-19 18:39:32,242 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-19 18:39:32,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-19 18:39:32,243 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-19 18:39:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-19 18:39:32,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-19 18:39:32,528 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-19 18:39:32,528 INFO L298 CfgBuilder]: Removed 5 assume(true) statements. [2020-10-19 18:39:32,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:39:32 BoogieIcfgContainer [2020-10-19 18:39:32,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-19 18:39:32,532 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-19 18:39:32,532 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-19 18:39:32,539 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-19 18:39:32,540 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:39:32,540 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 19.10 06:39:31" (1/3) ... [2020-10-19 18:39:32,545 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55778bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:39:32, skipping insertion in model container [2020-10-19 18:39:32,545 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:39:32,546 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.10 06:39:31" (2/3) ... [2020-10-19 18:39:32,546 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@55778bbd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 19.10 06:39:32, skipping insertion in model container [2020-10-19 18:39:32,546 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-19 18:39:32,547 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:39:32" (3/3) ... [2020-10-19 18:39:32,548 INFO L373 chiAutomizerObserver]: Analyzing ICFG 4BitCounterPointer.c [2020-10-19 18:39:32,631 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-19 18:39:32,631 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-19 18:39:32,632 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-19 18:39:32,632 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-19 18:39:32,632 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-19 18:39:32,632 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-19 18:39:32,633 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-19 18:39:32,633 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-19 18:39:32,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-19 18:39:32,672 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:39:32,672 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:39:32,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:39:32,682 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:39:32,682 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:39:32,682 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-19 18:39:32,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2020-10-19 18:39:32,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:39:32,684 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:39:32,684 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:39:32,685 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-19 18:39:32,685 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2020-10-19 18:39:32,694 INFO L794 eck$LassoCheckResult]: Stem: 4#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 3#L-1true havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 6#L24-2true [2020-10-19 18:39:32,695 INFO L796 eck$LassoCheckResult]: Loop: 6#L24-2true call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 12#L15-1true assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 5#L16true assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 6#L24-2true [2020-10-19 18:39:32,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:32,701 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-19 18:39:32,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:32,710 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204305924] [2020-10-19 18:39:32,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:32,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:32,862 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:32,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:32,938 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:32,963 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:39:32,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:32,965 INFO L82 PathProgramCache]: Analyzing trace with hash 36905, now seen corresponding path program 1 times [2020-10-19 18:39:32,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:32,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [39518397] [2020-10-19 18:39:32,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:32,977 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:32,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:32,984 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:32,987 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:39:32,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:32,989 INFO L82 PathProgramCache]: Analyzing trace with hash 28695847, now seen corresponding path program 1 times [2020-10-19 18:39:32,989 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:32,990 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043274212] [2020-10-19 18:39:32,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:33,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:33,032 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:33,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:33,060 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:33,066 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:39:33,850 WARN L193 SmtUtils]: Spent 663.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 88 [2020-10-19 18:39:34,266 WARN L193 SmtUtils]: Spent 400.00 ms on a formula simplification that was a NOOP. DAG size: 86 [2020-10-19 18:39:34,284 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:39:34,288 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:39:34,288 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:39:34,289 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:39:34,289 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:39:34,289 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:34,289 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:39:34,290 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:39:34,290 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration1_Lasso [2020-10-19 18:39:34,290 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:39:34,291 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:39:34,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:39:34,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:39:34,326 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:39:34,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:39:34,890 WARN L193 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2020-10-19 18:39:35,028 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 56 [2020-10-19 18:39:35,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:39:35,033 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:39:35,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:39:35,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:39:35,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:39:35,227 WARN L193 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 39 [2020-10-19 18:39:35,641 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:39:35,648 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:39:35,657 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:35,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:35,661 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:39:35,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:35,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:35,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:35,666 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:39:35,666 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:35,670 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:39:35,767 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:35,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:35,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:35,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:35,771 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:35,779 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:35,781 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:35,790 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:35,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:35,832 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:35,832 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:39:35,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:35,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:35,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:35,842 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:39:35,843 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:39:35,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:39:35,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:35,884 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:35,884 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:35,884 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:35,884 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:35,887 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:35,888 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:35,892 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:35,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:35,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:35,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:35,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:35,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:35,933 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:35,935 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:35,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:39:35,970 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:35,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:35,973 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:35,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:35,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:35,978 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:35,978 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:35,984 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,020 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:36,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:36,023 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:36,023 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:36,023 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:36,028 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:36,028 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:36,033 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,058 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:36,060 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:36,060 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:36,061 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:36,061 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:36,073 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:36,073 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:36,091 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:36,129 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:36,130 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:36,130 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:36,130 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:36,132 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:36,132 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:36,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:36,179 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:36,179 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:36,179 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:36,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:36,182 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:36,182 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:36,187 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:39:36,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:36,238 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:36,239 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:36,239 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:36,239 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:36,241 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:36,242 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:39:36,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:36,296 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:36,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:36,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:36,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:36,300 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:36,300 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,307 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:39:36,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:36,349 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:36,349 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:36,349 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:36,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:36,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:36,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:36,394 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:36,394 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:36,394 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:36,395 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:36,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:36,401 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:36,419 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:36,464 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:36,465 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:36,465 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:36,465 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:36,467 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:36,467 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:36,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,513 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:39:36,514 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:39:36,514 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:39:36,515 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:39:36,515 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:39:36,517 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:39:36,517 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:39:36,522 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:39:36,543 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2020-10-19 18:39:36,543 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:39:36,566 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:39:36,572 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:39:36,573 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:39:36,574 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x0~0.base) ULTIMATE.start_main_~x0~0.offset)_1 + 1 Supporting invariants [] [2020-10-19 18:39:36,775 INFO L297 tatePredicateManager]: 36 out of 36 supporting invariants were superfluous and have been removed [2020-10-19 18:39:36,785 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-19 18:39:36,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:36,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:39:36,825 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:39:36,827 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:39:36,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:39:36,842 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-19 18:39:36,843 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:39:36,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:39:36,873 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-19 18:39:36,875 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2020-10-19 18:39:36,925 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 29 states and 36 transitions. Complement of second has 8 states. [2020-10-19 18:39:36,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2020-10-19 18:39:36,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-10-19 18:39:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2020-10-19 18:39:36,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 3 letters. [2020-10-19 18:39:36,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:39:36,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 3 letters. [2020-10-19 18:39:36,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:39:36,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 2 letters. Loop has 6 letters. [2020-10-19 18:39:36,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:39:36,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 36 transitions. [2020-10-19 18:39:36,937 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:39:36,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 13 states and 18 transitions. [2020-10-19 18:39:36,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2020-10-19 18:39:36,943 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2020-10-19 18:39:36,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 18 transitions. [2020-10-19 18:39:36,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:39:36,944 INFO L691 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 18:39:36,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states and 18 transitions. [2020-10-19 18:39:36,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2020-10-19 18:39:36,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2020-10-19 18:39:36,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 18 transitions. [2020-10-19 18:39:36,975 INFO L714 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 18:39:36,975 INFO L594 BuchiCegarLoop]: Abstraction has 13 states and 18 transitions. [2020-10-19 18:39:36,975 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-19 18:39:36,976 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states and 18 transitions. [2020-10-19 18:39:36,976 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-19 18:39:36,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:39:36,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:39:36,977 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2020-10-19 18:39:36,978 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 18:39:36,978 INFO L794 eck$LassoCheckResult]: Stem: 233#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 227#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 228#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 237#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 229#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 230#L20 [2020-10-19 18:39:36,978 INFO L796 eck$LassoCheckResult]: Loop: 230#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 234#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 235#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 239#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 230#L20 [2020-10-19 18:39:36,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:36,979 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2020-10-19 18:39:36,979 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:36,979 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605681281] [2020-10-19 18:39:36,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:37,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:39:37,109 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:39:37,109 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605681281] [2020-10-19 18:39:37,110 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:39:37,110 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-19 18:39:37,111 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50585155] [2020-10-19 18:39:37,115 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:39:37,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:37,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 1 times [2020-10-19 18:39:37,116 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:37,116 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477866688] [2020-10-19 18:39:37,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:37,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:37,141 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:37,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:37,156 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:37,159 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:39:37,282 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:39:37,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-19 18:39:37,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-19 18:39:37,287 INFO L87 Difference]: Start difference. First operand 13 states and 18 transitions. cyclomatic complexity: 7 Second operand 5 states. [2020-10-19 18:39:37,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:39:37,380 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2020-10-19 18:39:37,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-19 18:39:37,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2020-10-19 18:39:37,383 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:39:37,383 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 18 states and 22 transitions. [2020-10-19 18:39:37,384 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2020-10-19 18:39:37,384 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2020-10-19 18:39:37,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 22 transitions. [2020-10-19 18:39:37,384 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:39:37,384 INFO L691 BuchiCegarLoop]: Abstraction has 18 states and 22 transitions. [2020-10-19 18:39:37,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 22 transitions. [2020-10-19 18:39:37,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 16. [2020-10-19 18:39:37,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-19 18:39:37,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-10-19 18:39:37,387 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-19 18:39:37,388 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-19 18:39:37,388 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-19 18:39:37,388 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-10-19 18:39:37,389 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:39:37,389 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:39:37,389 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:39:37,390 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-19 18:39:37,390 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-19 18:39:37,390 INFO L794 eck$LassoCheckResult]: Stem: 278#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 272#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 273#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 280#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 276#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 277#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 281#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 284#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 285#L20 [2020-10-19 18:39:37,390 INFO L796 eck$LassoCheckResult]: Loop: 285#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 275#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 279#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 287#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 285#L20 [2020-10-19 18:39:37,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:37,391 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 1 times [2020-10-19 18:39:37,391 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:37,391 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536395925] [2020-10-19 18:39:37,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:37,415 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:37,438 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:37,445 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:39:37,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:37,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1526457, now seen corresponding path program 2 times [2020-10-19 18:39:37,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:37,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206812343] [2020-10-19 18:39:37,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:37,452 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:37,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:37,458 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:37,460 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:39:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:37,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1467212285, now seen corresponding path program 1 times [2020-10-19 18:39:37,461 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:37,462 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579490605] [2020-10-19 18:39:37,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:39:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:39:37,583 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579490605] [2020-10-19 18:39:37,584 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663162731] [2020-10-19 18:39:37,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:39:37,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:39:37,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 14 conjunts are in the unsatisfiable core [2020-10-19 18:39:37,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:39:37,705 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2020-10-19 18:39:37,707 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:39:37,709 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:39:37,710 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:39:37,710 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2020-10-19 18:39:37,720 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-19 18:39:37,721 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:39:37,725 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:39:37,726 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:39:37,726 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2020-10-19 18:39:37,752 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-19 18:39:37,754 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:39:37,760 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:39:37,764 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 18:39:37,764 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2020-10-19 18:39:37,815 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-19 18:39:37,817 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:39:37,821 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:39:37,823 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:39:37,824 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2020-10-19 18:39:37,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-19 18:39:37,825 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:39:37,826 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-10-19 18:39:37,826 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373750473] [2020-10-19 18:39:37,937 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:39:37,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-19 18:39:37,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2020-10-19 18:39:37,938 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 9 states. [2020-10-19 18:39:38,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:39:38,060 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2020-10-19 18:39:38,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 18:39:38,061 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2020-10-19 18:39:38,062 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2020-10-19 18:39:38,063 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 21 states and 25 transitions. [2020-10-19 18:39:38,063 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-19 18:39:38,064 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-19 18:39:38,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2020-10-19 18:39:38,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:39:38,064 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2020-10-19 18:39:38,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2020-10-19 18:39:38,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2020-10-19 18:39:38,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-19 18:39:38,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-10-19 18:39:38,067 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-19 18:39:38,068 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-19 18:39:38,068 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-19 18:39:38,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-10-19 18:39:38,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:39:38,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:39:38,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:39:38,070 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-19 18:39:38,070 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-19 18:39:38,070 INFO L794 eck$LassoCheckResult]: Stem: 368#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 362#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 363#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 371#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 366#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 367#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 372#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 375#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 374#L20 [2020-10-19 18:39:38,070 INFO L796 eck$LassoCheckResult]: Loop: 374#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 373#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 365#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 376#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 377#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 374#L20 [2020-10-19 18:39:38,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:38,071 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 2 times [2020-10-19 18:39:38,071 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:38,071 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857854173] [2020-10-19 18:39:38,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:38,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:38,090 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:38,111 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:38,116 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:39:38,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:38,117 INFO L82 PathProgramCache]: Analyzing trace with hash 49698504, now seen corresponding path program 1 times [2020-10-19 18:39:38,117 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:38,118 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492979213] [2020-10-19 18:39:38,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:38,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:38,124 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:38,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:39:38,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:39:38,133 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:39:38,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:39:38,133 INFO L82 PathProgramCache]: Analyzing trace with hash -1758681084, now seen corresponding path program 1 times [2020-10-19 18:39:38,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:39:38,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354281185] [2020-10-19 18:39:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:39:38,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:39:38,228 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:39:38,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354281185] [2020-10-19 18:39:38,228 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661747166] [2020-10-19 18:39:38,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:39:38,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:39:38,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 19 conjunts are in the unsatisfiable core [2020-10-19 18:39:38,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:39:38,319 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:39:38,320 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2020-10-19 18:39:38,325 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:39:38,330 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:39:38,330 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:39:38,330 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2020-10-19 18:39:38,353 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-19 18:39:38,353 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:39:38,361 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:39:38,362 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:39:38,362 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-10-19 18:39:38,398 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-19 18:39:38,399 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:39:38,412 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:39:38,417 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 18:39:38,418 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-10-19 18:39:38,501 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-19 18:39:38,502 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:39:38,513 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:39:38,522 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-19 18:39:38,523 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:38, output treesize:34 [2020-10-19 18:39:38,652 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-19 18:39:38,656 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:39:38,663 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:39:38,665 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:39:38,665 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:41, output treesize:3 [2020-10-19 18:39:38,667 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-19 18:39:38,668 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:39:38,668 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-10-19 18:39:38,668 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954885230] [2020-10-19 18:39:38,851 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:39:38,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-10-19 18:39:38,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2020-10-19 18:39:38,852 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 13 states. [2020-10-19 18:40:03,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:40:03,173 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2020-10-19 18:40:03,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-19 18:40:03,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 28 transitions. [2020-10-19 18:40:03,176 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2020-10-19 18:40:03,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 24 states and 28 transitions. [2020-10-19 18:40:03,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-19 18:40:03,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-19 18:40:03,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2020-10-19 18:40:03,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:40:03,178 INFO L691 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2020-10-19 18:40:03,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2020-10-19 18:40:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 16. [2020-10-19 18:40:03,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2020-10-19 18:40:03,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2020-10-19 18:40:03,181 INFO L714 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-19 18:40:03,181 INFO L594 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2020-10-19 18:40:03,182 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-19 18:40:03,182 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2020-10-19 18:40:03,183 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:40:03,183 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:40:03,183 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:40:03,184 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-19 18:40:03,184 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-10-19 18:40:03,184 INFO L794 eck$LassoCheckResult]: Stem: 472#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 466#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 467#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 475#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 470#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 471#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 476#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 479#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 478#L20 [2020-10-19 18:40:03,185 INFO L796 eck$LassoCheckResult]: Loop: 478#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 473#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 474#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 468#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 469#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 480#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 481#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 478#L20 [2020-10-19 18:40:03,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:03,185 INFO L82 PathProgramCache]: Analyzing trace with hash 179493189, now seen corresponding path program 3 times [2020-10-19 18:40:03,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:03,186 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431806710] [2020-10-19 18:40:03,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:03,204 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:03,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:03,221 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:03,226 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:03,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:03,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1770012235, now seen corresponding path program 1 times [2020-10-19 18:40:03,227 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:03,228 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487379263] [2020-10-19 18:40:03,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:03,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:03,236 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:03,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:03,252 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:03,258 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:03,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:03,262 INFO L82 PathProgramCache]: Analyzing trace with hash -161041423, now seen corresponding path program 2 times [2020-10-19 18:40:03,262 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:03,262 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985808550] [2020-10-19 18:40:03,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:03,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:03,284 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:03,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:03,332 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:03,342 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:03,542 WARN L193 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 66 [2020-10-19 18:40:03,685 WARN L193 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 52 [2020-10-19 18:40:04,764 WARN L193 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 147 DAG size of output: 113 [2020-10-19 18:40:05,030 WARN L193 SmtUtils]: Spent 254.00 ms on a formula simplification that was a NOOP. DAG size: 93 [2020-10-19 18:40:05,034 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:40:05,035 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:40:05,035 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:40:05,035 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:40:05,035 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:40:05,035 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:05,035 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:40:05,036 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:40:05,036 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration5_Lasso [2020-10-19 18:40:05,036 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:40:05,036 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:40:05,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:05,535 WARN L193 SmtUtils]: Spent 250.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 78 [2020-10-19 18:40:05,688 WARN L193 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 65 [2020-10-19 18:40:05,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:05,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:05,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:05,698 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:05,700 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:05,703 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:05,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:05,991 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2020-10-19 18:40:06,328 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:40:06,328 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:40:06,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:06,340 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:06,340 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:06,340 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:06,340 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:06,346 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:06,347 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:06,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:40:06,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:06,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:06,410 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:06,410 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:06,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:06,414 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:06,414 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:06,424 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:40:06,446 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-19 18:40:06,446 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:06,454 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:40:06,456 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2020-10-19 18:40:06,457 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:40:06,457 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 3 Supporting invariants [3*ULTIMATE.start_main_#t~mem6 - 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 >= 0, -1*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_2 + 1 >= 0] [2020-10-19 18:40:06,670 INFO L297 tatePredicateManager]: 38 out of 39 supporting invariants were superfluous and have been removed [2020-10-19 18:40:06,673 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-19 18:40:06,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:06,736 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-19 18:40:06,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:06,818 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:06,819 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-10-19 18:40:06,824 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:06,827 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:06,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:06,831 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:06,833 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:06,834 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:06,843 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-19 18:40:06,844 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:06,845 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:06,847 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:06,852 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:06,884 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:06,901 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 29 [2020-10-19 18:40:06,902 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:06,928 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:06,935 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:06,936 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:158, output treesize:54 [2020-10-19 18:40:07,049 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2020-10-19 18:40:07,051 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:07,085 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:07,090 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:07,090 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:54 [2020-10-19 18:40:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:07,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:40:07,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:07,183 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2020-10-19 18:40:07,188 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:07,199 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:07,216 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:07,217 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:34 [2020-10-19 18:40:07,348 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:07,349 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 57 [2020-10-19 18:40:07,350 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-19 18:40:07,353 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:07,399 INFO L625 ElimStorePlain]: treesize reduction 24, result has 67.6 percent of original size [2020-10-19 18:40:07,403 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:07,404 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:52, output treesize:50 [2020-10-19 18:40:07,537 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:40:07,537 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 4 loop predicates [2020-10-19 18:40:07,537 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-10-19 18:40:07,663 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 22 states and 28 transitions. Complement of second has 6 states. [2020-10-19 18:40:07,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 3 stem states 0 non-accepting loop states 2 accepting loop states [2020-10-19 18:40:07,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 18:40:07,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2020-10-19 18:40:07,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 8 letters. Loop has 7 letters. [2020-10-19 18:40:07,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:40:07,665 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-19 18:40:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:07,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:07,753 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 17 conjunts are in the unsatisfiable core [2020-10-19 18:40:07,754 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:07,809 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:07,810 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-10-19 18:40:07,811 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:07,812 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:07,814 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:07,815 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:07,816 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:07,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:07,818 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:07,820 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:07,821 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:07,823 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:07,827 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-19 18:40:07,828 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:07,829 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:07,855 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:07,860 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 29 [2020-10-19 18:40:07,861 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:07,882 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:07,887 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:07,888 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:158, output treesize:54 [2020-10-19 18:40:07,957 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2020-10-19 18:40:07,959 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:07,978 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:07,982 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:07,983 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:65, output treesize:54 [2020-10-19 18:40:08,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:08,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 10 conjunts are in the unsatisfiable core [2020-10-19 18:40:08,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:08,055 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 22 [2020-10-19 18:40:08,056 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:08,073 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:08,086 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:08,086 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:37, output treesize:52 [2020-10-19 18:40:08,214 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:08,214 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 57 [2020-10-19 18:40:08,215 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-19 18:40:08,217 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:08,273 INFO L625 ElimStorePlain]: treesize reduction 24, result has 73.9 percent of original size [2020-10-19 18:40:08,277 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:08,278 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:70, output treesize:68 [2020-10-19 18:40:08,411 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:40:08,412 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 4 loop predicates [2020-10-19 18:40:08,412 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6 Second operand 7 states. [2020-10-19 18:40:08,617 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 41 states and 53 transitions. Complement of second has 14 states. [2020-10-19 18:40:08,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-19 18:40:08,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-10-19 18:40:08,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 25 transitions. [2020-10-19 18:40:08,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 7 letters. [2020-10-19 18:40:08,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:40:08,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 15 letters. Loop has 7 letters. [2020-10-19 18:40:08,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:40:08,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 25 transitions. Stem has 8 letters. Loop has 14 letters. [2020-10-19 18:40:08,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:40:08,621 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 53 transitions. [2020-10-19 18:40:08,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:40:08,622 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 27 states and 34 transitions. [2020-10-19 18:40:08,623 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 18:40:08,623 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-19 18:40:08,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2020-10-19 18:40:08,623 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:40:08,624 INFO L691 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2020-10-19 18:40:08,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2020-10-19 18:40:08,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2020-10-19 18:40:08,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-19 18:40:08,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2020-10-19 18:40:08,626 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-19 18:40:08,626 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2020-10-19 18:40:08,627 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-19 18:40:08,627 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2020-10-19 18:40:08,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:40:08,628 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:40:08,628 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:40:08,628 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-19 18:40:08,628 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-10-19 18:40:08,629 INFO L794 eck$LassoCheckResult]: Stem: 860#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 854#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 855#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 861#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 858#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 859#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 862#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 865#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 874#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 863#L24 [2020-10-19 18:40:08,629 INFO L796 eck$LassoCheckResult]: Loop: 863#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 864#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 877#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 856#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 857#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 876#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 875#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 866#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 863#L24 [2020-10-19 18:40:08,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:08,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1269321585, now seen corresponding path program 1 times [2020-10-19 18:40:08,630 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:08,630 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603000668] [2020-10-19 18:40:08,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:08,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:08,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:40:08,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603000668] [2020-10-19 18:40:08,724 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [726914235] [2020-10-19 18:40:08,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:40:08,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:08,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjunts are in the unsatisfiable core [2020-10-19 18:40:08,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:08,804 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:08,805 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2020-10-19 18:40:08,805 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:08,807 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:08,808 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:08,828 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:08,834 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 29 [2020-10-19 18:40:08,835 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:08,854 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:08,857 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:08,858 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:157, output treesize:53 [2020-10-19 18:40:08,903 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2020-10-19 18:40:08,905 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:08,922 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:08,925 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:08,926 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:64, output treesize:53 [2020-10-19 18:40:09,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 18:40:09,012 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 16 [2020-10-19 18:40:09,014 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:09,025 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:09,027 INFO L545 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:09,027 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 9 variables, input treesize:68, output treesize:3 [2020-10-19 18:40:09,029 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:40:09,029 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:40:09,029 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 7 [2020-10-19 18:40:09,030 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490101100] [2020-10-19 18:40:09,030 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:40:09,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:09,030 INFO L82 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 1 times [2020-10-19 18:40:09,030 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:09,031 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700300335] [2020-10-19 18:40:09,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:09,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:09,039 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:09,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:09,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:09,049 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:09,299 WARN L193 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 86 [2020-10-19 18:40:09,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:40:09,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-10-19 18:40:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2020-10-19 18:40:09,375 INFO L87 Difference]: Start difference. First operand 24 states and 30 transitions. cyclomatic complexity: 9 Second operand 8 states. [2020-10-19 18:40:09,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:40:09,530 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2020-10-19 18:40:09,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-19 18:40:09,531 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 29 states and 34 transitions. [2020-10-19 18:40:09,532 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:40:09,532 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 29 states to 29 states and 34 transitions. [2020-10-19 18:40:09,532 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 18:40:09,533 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 18:40:09,533 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 34 transitions. [2020-10-19 18:40:09,533 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:40:09,533 INFO L691 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2020-10-19 18:40:09,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 34 transitions. [2020-10-19 18:40:09,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2020-10-19 18:40:09,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2020-10-19 18:40:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2020-10-19 18:40:09,536 INFO L714 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-10-19 18:40:09,536 INFO L594 BuchiCegarLoop]: Abstraction has 24 states and 29 transitions. [2020-10-19 18:40:09,536 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-19 18:40:09,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 29 transitions. [2020-10-19 18:40:09,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2020-10-19 18:40:09,537 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:40:09,537 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:40:09,538 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2020-10-19 18:40:09,538 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-10-19 18:40:09,538 INFO L794 eck$LassoCheckResult]: Stem: 948#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 946#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 947#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 953#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 951#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 952#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 968#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 965#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 960#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 954#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 955#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 959#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 967#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 964#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 962#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 961#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 956#L24 [2020-10-19 18:40:09,538 INFO L796 eck$LassoCheckResult]: Loop: 956#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 957#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 958#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 949#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 950#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 969#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 966#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 963#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 956#L24 [2020-10-19 18:40:09,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:09,539 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 1 times [2020-10-19 18:40:09,539 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:09,539 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767542921] [2020-10-19 18:40:09,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:09,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:09,557 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:09,571 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:09,576 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:09,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:09,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1088312668, now seen corresponding path program 2 times [2020-10-19 18:40:09,577 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:09,577 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004671594] [2020-10-19 18:40:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:09,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:09,584 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:09,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:09,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:09,592 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:09,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:09,593 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122080, now seen corresponding path program 1 times [2020-10-19 18:40:09,593 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:09,593 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512748484] [2020-10-19 18:40:09,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:09,730 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-19 18:40:09,730 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512748484] [2020-10-19 18:40:09,731 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [983288485] [2020-10-19 18:40:09,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:40:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:09,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 20 conjunts are in the unsatisfiable core [2020-10-19 18:40:09,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:09,803 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:09,803 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2020-10-19 18:40:09,808 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:09,820 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:09,820 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:09,820 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2020-10-19 18:40:09,852 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-19 18:40:09,852 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:09,859 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:09,859 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:09,859 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2020-10-19 18:40:09,878 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2020-10-19 18:40:09,879 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:09,888 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:09,889 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:09,889 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:31, output treesize:27 [2020-10-19 18:40:09,933 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 28 [2020-10-19 18:40:09,934 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:09,944 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:09,945 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:09,945 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:34 [2020-10-19 18:40:09,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 18:40:09,998 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2020-10-19 18:40:10,000 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:10,007 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:10,008 INFO L545 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:10,009 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:49, output treesize:3 [2020-10-19 18:40:10,012 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 26 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-19 18:40:10,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:40:10,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 11 [2020-10-19 18:40:10,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437927685] [2020-10-19 18:40:10,343 WARN L193 SmtUtils]: Spent 328.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 84 [2020-10-19 18:40:10,444 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:40:10,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-10-19 18:40:10,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2020-10-19 18:40:10,444 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. cyclomatic complexity: 8 Second operand 12 states. [2020-10-19 18:40:10,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:40:10,636 INFO L93 Difference]: Finished difference Result 31 states and 37 transitions. [2020-10-19 18:40:10,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-19 18:40:10,638 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 37 transitions. [2020-10-19 18:40:10,638 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-19 18:40:10,639 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 31 states and 37 transitions. [2020-10-19 18:40:10,639 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-19 18:40:10,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-19 18:40:10,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 37 transitions. [2020-10-19 18:40:10,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:40:10,640 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-19 18:40:10,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 37 transitions. [2020-10-19 18:40:10,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-19 18:40:10,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 18:40:10,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 37 transitions. [2020-10-19 18:40:10,643 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-19 18:40:10,643 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 37 transitions. [2020-10-19 18:40:10,643 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-19 18:40:10,643 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 37 transitions. [2020-10-19 18:40:10,644 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-19 18:40:10,644 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:40:10,644 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:40:10,645 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2020-10-19 18:40:10,645 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1] [2020-10-19 18:40:10,645 INFO L794 eck$LassoCheckResult]: Stem: 1101#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1095#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1096#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1105#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1099#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1100#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1104#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1123#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1122#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1110#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1119#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1118#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1116#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1113#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1111#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1109#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1106#L24 [2020-10-19 18:40:10,646 INFO L796 eck$LassoCheckResult]: Loop: 1106#L24 assume !(0 == main_#t~mem7);havoc main_#t~mem7;call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(1, main_~x3~0.base, main_~x3~0.offset, 4); 1107#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1121#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1120#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1115#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1117#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1114#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1112#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1106#L24 [2020-10-19 18:40:10,646 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:10,646 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 2 times [2020-10-19 18:40:10,646 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:10,646 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989957967] [2020-10-19 18:40:10,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:10,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:10,662 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:10,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:10,676 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:10,681 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:10,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:10,681 INFO L82 PathProgramCache]: Analyzing trace with hash 278966042, now seen corresponding path program 1 times [2020-10-19 18:40:10,682 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:10,682 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567747515] [2020-10-19 18:40:10,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:10,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:10,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-10-19 18:40:10,700 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567747515] [2020-10-19 18:40:10,700 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-19 18:40:10,700 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-19 18:40:10,700 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332867575] [2020-10-19 18:40:10,701 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-19 18:40:10,701 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:40:10,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-19 18:40:10,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-19 18:40:10,702 INFO L87 Difference]: Start difference. First operand 31 states and 37 transitions. cyclomatic complexity: 9 Second operand 4 states. [2020-10-19 18:40:10,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:40:10,738 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2020-10-19 18:40:10,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-19 18:40:10,738 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 38 transitions. [2020-10-19 18:40:10,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-19 18:40:10,739 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 31 states and 36 transitions. [2020-10-19 18:40:10,739 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-19 18:40:10,740 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-19 18:40:10,740 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 36 transitions. [2020-10-19 18:40:10,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:40:10,741 INFO L691 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-10-19 18:40:10,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 36 transitions. [2020-10-19 18:40:10,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-10-19 18:40:10,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-10-19 18:40:10,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2020-10-19 18:40:10,743 INFO L714 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-10-19 18:40:10,744 INFO L594 BuchiCegarLoop]: Abstraction has 31 states and 36 transitions. [2020-10-19 18:40:10,744 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-19 18:40:10,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 36 transitions. [2020-10-19 18:40:10,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2020-10-19 18:40:10,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:40:10,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:40:10,746 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1] [2020-10-19 18:40:10,746 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 2, 2, 1, 1, 1] [2020-10-19 18:40:10,746 INFO L794 eck$LassoCheckResult]: Stem: 1174#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1168#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1169#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1178#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1172#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1173#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1177#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1196#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1195#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1183#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1192#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1191#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1189#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1186#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1184#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1182#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1179#L24 [2020-10-19 18:40:10,747 INFO L796 eck$LassoCheckResult]: Loop: 1179#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1175#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1176#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1170#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1171#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1198#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1197#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1180#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1181#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1194#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1193#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1188#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1190#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1187#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1185#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1179#L24 [2020-10-19 18:40:10,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:10,747 INFO L82 PathProgramCache]: Analyzing trace with hash -697316795, now seen corresponding path program 3 times [2020-10-19 18:40:10,747 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:10,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759111673] [2020-10-19 18:40:10,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:10,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:10,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:10,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:10,786 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:10,793 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:10,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:10,794 INFO L82 PathProgramCache]: Analyzing trace with hash 2047759866, now seen corresponding path program 1 times [2020-10-19 18:40:10,794 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:10,795 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495176417] [2020-10-19 18:40:10,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:10,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:10,816 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:10,828 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:10,856 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:10,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:10,858 INFO L82 PathProgramCache]: Analyzing trace with hash 462437174, now seen corresponding path program 2 times [2020-10-19 18:40:10,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:10,860 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761276207] [2020-10-19 18:40:10,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:10,897 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:10,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:10,925 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:10,929 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:11,655 WARN L193 SmtUtils]: Spent 723.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 117 [2020-10-19 18:40:11,849 WARN L193 SmtUtils]: Spent 190.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2020-10-19 18:40:14,391 WARN L193 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 195 DAG size of output: 153 [2020-10-19 18:40:14,846 WARN L193 SmtUtils]: Spent 450.00 ms on a formula simplification that was a NOOP. DAG size: 102 [2020-10-19 18:40:14,855 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:40:14,855 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:40:14,855 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:40:14,856 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:40:14,856 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:40:14,856 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:14,856 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:40:14,856 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:40:14,856 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration9_Lasso [2020-10-19 18:40:14,857 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:40:14,857 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:40:14,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:14,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:14,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:15,503 WARN L193 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 80 [2020-10-19 18:40:15,711 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2020-10-19 18:40:15,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:15,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:15,718 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:15,720 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:15,722 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:15,724 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:16,013 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2020-10-19 18:40:16,410 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:40:16,410 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,418 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,419 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:40:16,420 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,420 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,420 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:40:16,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:40:16,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,449 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,449 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,449 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,449 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,450 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,450 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,453 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,478 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,479 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,479 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,479 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,484 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,485 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,497 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,523 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,525 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,525 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,525 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,525 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,526 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,526 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,555 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,555 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,555 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,555 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,557 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,557 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,562 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,590 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,592 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,592 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,621 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,622 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,622 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,622 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,624 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,625 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,661 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,662 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,662 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,663 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,663 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,667 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,695 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,695 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,706 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,731 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,733 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,733 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,733 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,733 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,735 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,735 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,741 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,771 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:16,773 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,773 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,773 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,773 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,775 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,775 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,782 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:40:16,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,814 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,814 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,814 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,814 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,828 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,828 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,851 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:40:16,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,878 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:16,878 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:16,879 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:16,879 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:16,882 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:16,882 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:16,889 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:40:16,905 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-19 18:40:16,906 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:40:16,912 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:16,914 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:40:16,915 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:40:16,915 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem7) = -2*ULTIMATE.start_main_#t~mem7 + 1 Supporting invariants [] [2020-10-19 18:40:17,196 INFO L297 tatePredicateManager]: 42 out of 42 supporting invariants were superfluous and have been removed [2020-10-19 18:40:17,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:17,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:17,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:40:17,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:17,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:17,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 15 conjunts are in the unsatisfiable core [2020-10-19 18:40:17,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:17,325 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-19 18:40:17,326 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,337 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:17,338 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,338 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:15 [2020-10-19 18:40:17,397 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:17,398 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 57 [2020-10-19 18:40:17,398 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-19 18:40:17,400 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,430 INFO L625 ElimStorePlain]: treesize reduction 24, result has 56.4 percent of original size [2020-10-19 18:40:17,430 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,430 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:33, output treesize:31 [2020-10-19 18:40:17,468 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-10-19 18:40:17,470 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,481 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:17,481 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2020-10-19 18:40:17,483 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,514 INFO L625 ElimStorePlain]: treesize reduction 38, result has 43.3 percent of original size [2020-10-19 18:40:17,515 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,515 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:29 [2020-10-19 18:40:17,649 INFO L350 Elim1Store]: treesize reduction 12, result has 87.9 percent of original size [2020-10-19 18:40:17,649 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2020-10-19 18:40:17,651 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 3 disjuncts [2020-10-19 18:40:17,653 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-19 18:40:17,660 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,712 INFO L625 ElimStorePlain]: treesize reduction 40, result has 53.5 percent of original size [2020-10-19 18:40:17,712 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,713 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:40, output treesize:46 [2020-10-19 18:40:17,752 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 18:40:17,832 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:17,833 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 103 [2020-10-19 18:40:17,834 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,855 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-10-19 18:40:17,856 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,871 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:17,872 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2020-10-19 18:40:17,877 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:17,937 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:17,938 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 103 [2020-10-19 18:40:17,939 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:18,072 WARN L193 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 36 [2020-10-19 18:40:18,073 INFO L625 ElimStorePlain]: treesize reduction 178, result has 32.3 percent of original size [2020-10-19 18:40:18,073 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2020-10-19 18:40:18,074 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:175, output treesize:85 [2020-10-19 18:40:18,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:18,143 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:18,184 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:18,185 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 67 [2020-10-19 18:40:18,185 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:18,219 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:18,219 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 67 [2020-10-19 18:40:18,220 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:18,259 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:18,260 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 67 [2020-10-19 18:40:18,261 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:18,297 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:18,297 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 67 [2020-10-19 18:40:18,298 INFO L545 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:18,398 INFO L625 ElimStorePlain]: treesize reduction 162, result has 33.9 percent of original size [2020-10-19 18:40:18,399 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:18,401 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 2 xjuncts. [2020-10-19 18:40:18,401 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:193, output treesize:83 [2020-10-19 18:40:18,401 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:18,402 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:18,471 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:40:18,471 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 8 loop predicates [2020-10-19 18:40:18,471 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8 Second operand 9 states. [2020-10-19 18:40:19,883 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 31 states and 36 transitions. cyclomatic complexity: 8. Second operand 9 states. Result 61 states and 71 transitions. Complement of second has 23 states. [2020-10-19 18:40:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 13 states 1 stem states 10 non-accepting loop states 1 accepting loop states [2020-10-19 18:40:19,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-10-19 18:40:19,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 33 transitions. [2020-10-19 18:40:19,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 33 transitions. Stem has 16 letters. Loop has 15 letters. [2020-10-19 18:40:19,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:40:19,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 33 transitions. Stem has 31 letters. Loop has 15 letters. [2020-10-19 18:40:19,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:40:19,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 13 states and 33 transitions. Stem has 16 letters. Loop has 30 letters. [2020-10-19 18:40:19,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:40:19,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 71 transitions. [2020-10-19 18:40:19,889 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 18:40:19,890 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 46 states and 51 transitions. [2020-10-19 18:40:19,890 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-19 18:40:19,890 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-19 18:40:19,890 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 51 transitions. [2020-10-19 18:40:19,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:40:19,891 INFO L691 BuchiCegarLoop]: Abstraction has 46 states and 51 transitions. [2020-10-19 18:40:19,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 51 transitions. [2020-10-19 18:40:19,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2020-10-19 18:40:19,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2020-10-19 18:40:19,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2020-10-19 18:40:19,894 INFO L714 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-10-19 18:40:19,895 INFO L594 BuchiCegarLoop]: Abstraction has 39 states and 44 transitions. [2020-10-19 18:40:19,895 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-19 18:40:19,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 39 states and 44 transitions. [2020-10-19 18:40:19,895 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 18:40:19,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:40:19,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:40:19,896 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 1, 1, 1, 1, 1] [2020-10-19 18:40:19,897 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-10-19 18:40:19,897 INFO L794 eck$LassoCheckResult]: Stem: 1581#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1579#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1580#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1592#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1584#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1585#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1613#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1611#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1609#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1598#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1608#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1606#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1604#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1602#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1600#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1597#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1590#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1586#L24-2 [2020-10-19 18:40:19,897 INFO L796 eck$LassoCheckResult]: Loop: 1586#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1587#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1582#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1583#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1617#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1616#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1593#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1586#L24-2 [2020-10-19 18:40:19,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:19,898 INFO L82 PathProgramCache]: Analyzing trace with hash -141984140, now seen corresponding path program 3 times [2020-10-19 18:40:19,898 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:19,898 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096999552] [2020-10-19 18:40:19,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:19,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:19,912 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:19,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:19,924 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:19,927 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:19,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:19,928 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 2 times [2020-10-19 18:40:19,928 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:19,928 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265978794] [2020-10-19 18:40:19,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:19,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:19,932 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:19,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:19,936 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:19,937 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:19,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:19,938 INFO L82 PathProgramCache]: Analyzing trace with hash -1710122082, now seen corresponding path program 4 times [2020-10-19 18:40:19,939 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:19,939 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761711251] [2020-10-19 18:40:19,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:19,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:19,955 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:19,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:19,967 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:19,971 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:20,117 WARN L193 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-10-19 18:40:23,135 WARN L193 SmtUtils]: Spent 2.97 s on a formula simplification. DAG size of input: 200 DAG size of output: 153 [2020-10-19 18:40:23,676 WARN L193 SmtUtils]: Spent 534.00 ms on a formula simplification that was a NOOP. DAG size: 101 [2020-10-19 18:40:23,680 INFO L210 LassoAnalysis]: Preferences: [2020-10-19 18:40:23,680 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-19 18:40:23,680 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-19 18:40:23,680 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-19 18:40:23,681 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-19 18:40:23,681 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:23,681 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-19 18:40:23,681 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-19 18:40:23,681 INFO L133 ssoRankerPreferences]: Filename of dumped script: 4BitCounterPointer.c_Iteration10_Lasso [2020-10-19 18:40:23,681 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-19 18:40:23,681 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-19 18:40:23,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:23,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:23,689 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:23,692 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:23,695 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:23,697 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:23,701 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:23,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:23,706 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:23,708 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2020-10-19 18:40:24,272 WARN L193 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 74 [2020-10-19 18:40:24,427 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2020-10-19 18:40:25,043 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-19 18:40:25,043 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:25,053 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:25,053 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:25,053 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:25,053 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:25,055 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:25,055 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:25,058 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:25,083 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:25,084 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:25,084 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:25,084 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:25,085 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:25,085 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:25,088 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,111 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:25,113 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:25,113 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:25,113 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:25,113 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:25,114 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:25,115 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:25,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:25,142 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:25,142 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:40:25,142 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:25,142 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:25,142 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:25,143 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:40:25,143 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:40:25,147 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:25,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:25,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:40:25,173 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:25,173 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:25,173 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:25,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:40:25,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:40:25,175 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,196 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:25,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:25,198 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:25,198 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:25,198 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:25,199 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:25,199 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:25,202 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,225 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:25,226 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:25,226 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:40:25,227 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:25,227 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:25,227 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:25,227 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:40:25,227 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:40:25,228 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,252 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:25,253 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:25,253 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:40:25,254 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:25,254 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:25,254 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:25,254 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:40:25,254 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:40:25,256 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-19 18:40:25,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,295 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:25,296 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-19 18:40:25,296 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:25,296 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:25,296 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:25,296 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-19 18:40:25,296 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-19 18:40:25,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,321 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2020-10-19 18:40:25,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-19 18:40:25,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-19 18:40:25,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-19 18:40:25,323 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-19 18:40:25,325 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-19 18:40:25,325 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-19 18:40:25,330 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-19 18:40:25,335 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2020-10-19 18:40:25,336 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-19 18:40:25,338 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-19 18:40:25,340 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-19 18:40:25,340 INFO L510 LassoAnalysis]: Proved termination. [2020-10-19 18:40:25,340 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_main_~x1~0.base) ULTIMATE.start_main_~x1~0.offset)_4 + 1 Supporting invariants [] [2020-10-19 18:40:25,519 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2020-10-19 18:40:25,521 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-10-19 18:40:25,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:25,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:25,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-19 18:40:25,563 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:25,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 9 conjunts are in the unsatisfiable core [2020-10-19 18:40:25,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:25,622 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:25,623 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 61 [2020-10-19 18:40:25,624 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:25,625 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-19 18:40:25,626 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:25,627 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-19 18:40:25,629 INFO L603 QuantifierPusher]: Distributing 3 conjuncts over 2 disjuncts [2020-10-19 18:40:25,630 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:25,685 INFO L625 ElimStorePlain]: treesize reduction 32, result has 57.9 percent of original size [2020-10-19 18:40:25,686 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:25,686 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:30, output treesize:44 [2020-10-19 18:40:25,725 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:25,726 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:25,743 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2020-10-19 18:40:25,745 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:25,758 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:25,758 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2020-10-19 18:40:25,759 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:25,763 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2020-10-19 18:40:25,764 INFO L545 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:25,808 INFO L625 ElimStorePlain]: treesize reduction 34, result has 59.0 percent of original size [2020-10-19 18:40:25,809 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2020-10-19 18:40:25,809 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:116, output treesize:49 [2020-10-19 18:40:25,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-19 18:40:25,846 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-19 18:40:25,846 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 9 Second operand 6 states. [2020-10-19 18:40:25,972 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 39 states and 44 transitions. cyclomatic complexity: 9. Second operand 6 states. Result 79 states and 86 transitions. Complement of second has 13 states. [2020-10-19 18:40:25,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 1 stem states 5 non-accepting loop states 1 accepting loop states [2020-10-19 18:40:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-19 18:40:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 16 transitions. [2020-10-19 18:40:25,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 7 letters. [2020-10-19 18:40:25,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:40:25,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 24 letters. Loop has 7 letters. [2020-10-19 18:40:25,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:40:25,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 16 transitions. Stem has 17 letters. Loop has 14 letters. [2020-10-19 18:40:25,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-19 18:40:25,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 86 transitions. [2020-10-19 18:40:25,978 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 18:40:25,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 59 states and 64 transitions. [2020-10-19 18:40:25,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-19 18:40:25,979 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-19 18:40:25,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 59 states and 64 transitions. [2020-10-19 18:40:25,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-19 18:40:25,980 INFO L691 BuchiCegarLoop]: Abstraction has 59 states and 64 transitions. [2020-10-19 18:40:25,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states and 64 transitions. [2020-10-19 18:40:25,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 53. [2020-10-19 18:40:25,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-10-19 18:40:25,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2020-10-19 18:40:25,985 INFO L714 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-10-19 18:40:25,985 INFO L594 BuchiCegarLoop]: Abstraction has 53 states and 58 transitions. [2020-10-19 18:40:25,985 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-19 18:40:25,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 58 transitions. [2020-10-19 18:40:25,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2020-10-19 18:40:25,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-19 18:40:25,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-19 18:40:25,987 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [8, 8, 4, 4, 2, 2, 2, 1, 1] [2020-10-19 18:40:25,987 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1] [2020-10-19 18:40:25,988 INFO L794 eck$LassoCheckResult]: Stem: 1959#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 1953#L-1 havoc main_#res;havoc main_#t~malloc0.base, main_#t~malloc0.offset, main_#t~malloc1.base, main_#t~malloc1.offset, main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~mem5, main_#t~mem6, main_#t~mem7, main_#t~mem4, main_~x0~0.base, main_~x0~0.offset, main_~x1~0.base, main_~x1~0.offset, main_~x2~0.base, main_~x2~0.offset, main_~x3~0.base, main_~x3~0.offset;call main_#t~malloc0.base, main_#t~malloc0.offset := #Ultimate.allocOnStack(4);main_~x0~0.base, main_~x0~0.offset := main_#t~malloc0.base, main_#t~malloc0.offset;call main_#t~malloc1.base, main_#t~malloc1.offset := #Ultimate.allocOnStack(4);main_~x1~0.base, main_~x1~0.offset := main_#t~malloc1.base, main_#t~malloc1.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.allocOnStack(4);main_~x2~0.base, main_~x2~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.allocOnStack(4);main_~x3~0.base, main_~x3~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call write~int(0, main_~x2~0.base, main_~x2~0.offset, 4);call write~int(0, main_~x3~0.base, main_~x3~0.offset, 4); 1954#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1960#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1985#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1984#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1967#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1968#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1980#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1974#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1979#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1978#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1977#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1976#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1975#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1973#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1963#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1961#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1962#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1957#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1958#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 2005#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1992#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1993#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1999#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1998#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1997#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1996#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1995#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1994#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1972#L20 assume !(0 == main_#t~mem6);havoc main_#t~mem6;call write~int(0, main_~x1~0.base, main_~x1~0.offset, 4);call main_#t~mem7 := read~int(main_~x2~0.base, main_~x2~0.offset, 4); 1964#L24 assume 0 == main_#t~mem7;havoc main_#t~mem7;call write~int(1, main_~x2~0.base, main_~x2~0.offset, 4); 1965#L24-2 [2020-10-19 18:40:25,988 INFO L796 eck$LassoCheckResult]: Loop: 1965#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1983#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1955#L16 assume 0 == main_#t~mem5;havoc main_#t~mem5;call write~int(1, main_~x0~0.base, main_~x0~0.offset, 4); 1956#L24-2 call main_#t~mem4 := read~int(main_~x3~0.base, main_~x3~0.offset, 4); 1982#L15-1 assume !!(0 == main_#t~mem4);havoc main_#t~mem4;call main_#t~mem5 := read~int(main_~x0~0.base, main_~x0~0.offset, 4); 1981#L16 assume !(0 == main_#t~mem5);havoc main_#t~mem5;call write~int(0, main_~x0~0.base, main_~x0~0.offset, 4);call main_#t~mem6 := read~int(main_~x1~0.base, main_~x1~0.offset, 4); 1969#L20 assume 0 == main_#t~mem6;havoc main_#t~mem6;call write~int(1, main_~x1~0.base, main_~x1~0.offset, 4); 1965#L24-2 [2020-10-19 18:40:25,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1450650531, now seen corresponding path program 5 times [2020-10-19 18:40:25,988 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:25,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765617842] [2020-10-19 18:40:25,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-19 18:40:26,323 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 35 proven. 43 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-10-19 18:40:26,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765617842] [2020-10-19 18:40:26,324 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [256332030] [2020-10-19 18:40:26,324 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 51 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-19 18:40:26,437 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2020-10-19 18:40:26,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-19 18:40:26,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 25 conjunts are in the unsatisfiable core [2020-10-19 18:40:26,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-19 18:40:26,462 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2020-10-19 18:40:26,463 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:26,470 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:26,470 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:26,470 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2020-10-19 18:40:26,537 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:26,537 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 26 treesize of output 45 [2020-10-19 18:40:26,538 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:26,540 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:26,566 INFO L625 ElimStorePlain]: treesize reduction 16, result has 63.6 percent of original size [2020-10-19 18:40:26,567 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:26,567 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:28 [2020-10-19 18:40:26,604 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-10-19 18:40:26,605 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:26,630 INFO L625 ElimStorePlain]: treesize reduction 4, result has 88.6 percent of original size [2020-10-19 18:40:26,631 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:26,631 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:46, output treesize:31 [2020-10-19 18:40:26,703 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:26,704 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 33 treesize of output 87 [2020-10-19 18:40:26,705 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-19 18:40:26,706 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:26,708 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:26,753 INFO L625 ElimStorePlain]: treesize reduction 42, result has 48.1 percent of original size [2020-10-19 18:40:26,753 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:26,754 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:39 [2020-10-19 18:40:26,793 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-19 18:40:26,864 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:26,865 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 33 treesize of output 79 [2020-10-19 18:40:26,867 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:26,877 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2020-10-19 18:40:26,879 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:27,003 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 26 [2020-10-19 18:40:27,003 INFO L625 ElimStorePlain]: treesize reduction 68, result has 36.4 percent of original size [2020-10-19 18:40:27,004 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:27,004 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:89, output treesize:39 [2020-10-19 18:40:27,090 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:27,090 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 55 [2020-10-19 18:40:27,091 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:27,138 INFO L625 ElimStorePlain]: treesize reduction 16, result has 69.2 percent of original size [2020-10-19 18:40:27,140 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:27,141 INFO L545 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2020-10-19 18:40:27,141 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:47, output treesize:36 [2020-10-19 18:40:27,142 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:27,203 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:27,206 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:27,207 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-19 18:40:27,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 18:40:27,225 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2020-10-19 18:40:27,226 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:27,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2020-10-19 18:40:27,243 INFO L350 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-10-19 18:40:27,244 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 29 [2020-10-19 18:40:27,245 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-19 18:40:27,264 INFO L625 ElimStorePlain]: treesize reduction 17, result has 32.0 percent of original size [2020-10-19 18:40:27,265 INFO L545 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-10-19 18:40:27,265 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:76, output treesize:3 [2020-10-19 18:40:27,304 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 59 proven. 13 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-19 18:40:27,305 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-19 18:40:27,305 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2020-10-19 18:40:27,306 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492412134] [2020-10-19 18:40:27,306 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-19 18:40:27,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-19 18:40:27,307 INFO L82 PathProgramCache]: Analyzing trace with hash -276975247, now seen corresponding path program 3 times [2020-10-19 18:40:27,307 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-19 18:40:27,308 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [920088881] [2020-10-19 18:40:27,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-19 18:40:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:27,314 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-19 18:40:27,318 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-19 18:40:27,321 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-19 18:40:27,521 WARN L193 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2020-10-19 18:40:27,591 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-19 18:40:27,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-10-19 18:40:27,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2020-10-19 18:40:27,592 INFO L87 Difference]: Start difference. First operand 53 states and 58 transitions. cyclomatic complexity: 10 Second operand 20 states. [2020-10-19 18:40:28,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-19 18:40:28,697 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2020-10-19 18:40:28,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-10-19 18:40:28,698 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 41 transitions. [2020-10-19 18:40:28,699 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:40:28,699 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 0 states and 0 transitions. [2020-10-19 18:40:28,699 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-19 18:40:28,699 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-19 18:40:28,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-19 18:40:28,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-19 18:40:28,699 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:40:28,699 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:40:28,699 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-19 18:40:28,700 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-19 18:40:28,700 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-19 18:40:28,700 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-19 18:40:28,700 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-19 18:40:28,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 19.10 06:40:28 BoogieIcfgContainer [2020-10-19 18:40:28,708 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-19 18:40:28,709 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-19 18:40:28,709 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-19 18:40:28,709 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-19 18:40:28,710 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.10 06:39:32" (3/4) ... [2020-10-19 18:40:28,714 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-19 18:40:28,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-19 18:40:28,716 INFO L168 Benchmark]: Toolchain (without parser) took 57033.03 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 445.1 MB). Free memory was 955.9 MB in the beginning and 917.2 MB in the end (delta: 38.8 MB). Peak memory consumption was 483.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:40:28,716 INFO L168 Benchmark]: CDTParser took 1.69 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:40:28,716 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.57 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2020-10-19 18:40:28,717 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.26 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2020-10-19 18:40:28,717 INFO L168 Benchmark]: Boogie Preprocessor took 92.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. [2020-10-19 18:40:28,718 INFO L168 Benchmark]: RCFGBuilder took 389.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. [2020-10-19 18:40:28,719 INFO L168 Benchmark]: BuchiAutomizer took 56176.69 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 917.2 MB in the end (delta: 167.3 MB). Peak memory consumption was 497.1 MB. Max. memory is 11.5 GB. [2020-10-19 18:40:28,719 INFO L168 Benchmark]: Witness Printer took 5.58 ms. Allocated memory is still 1.5 GB. Free memory is still 917.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-10-19 18:40:28,721 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.69 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 307.57 ms. Allocated memory is still 1.0 GB. Free memory was 955.9 MB in the beginning and 945.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.26 ms. Allocated memory is still 1.0 GB. Free memory was 945.2 MB in the beginning and 939.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 92.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 115.3 MB). Free memory was 939.8 MB in the beginning and 1.1 GB in the end (delta: -164.5 MB). Peak memory consumption was 9.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 389.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.8 MB). Peak memory consumption was 19.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 56176.69 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 329.8 MB). Free memory was 1.1 GB in the beginning and 917.2 MB in the end (delta: 167.3 MB). Peak memory consumption was 497.1 MB. Max. memory is 11.5 GB. * Witness Printer took 5.58 ms. Allocated memory is still 1.5 GB. Free memory is still 917.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (7 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x0][x0] + 1 and consists of 5 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 3 and consists of 9 locations. One deterministic module has affine ranking function -2 * aux-x2-aux + 1 and consists of 13 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x1][x1] + 1 and consists of 7 locations. 7 modules have a trivial ranking function, the largest among these consists of 20 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 56.0s and 12 iterations. TraceHistogramMax:8. Analysis of lassos took 24.5s. Construction of modules took 25.9s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 36 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 53 states and ocurred in iteration 10. Nontrivial modules had stage [3, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/25 HoareTripleCheckerStatistics: 51 SDtfs, 105 SDslu, 48 SDs, 0 SdLazy, 648 SolverSat, 117 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 25.9s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc3 concLT0 SILN0 SILU3 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital2006 mio100 ax100 hnf100 lsp98 ukn26 mio100 lsp40 div100 bol100 ite100 ukn100 eq184 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 42ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...