./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/loops/insertion_sort-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 9a8b2e8d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/loops/insertion_sort-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-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 32bit --witnessprinter.graph.data.programhash 25b1595a40c04d1f29f2431a3990f69b3ca92105 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-9a8b2e8 [2020-10-20 07:03:15,411 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-20 07:03:15,414 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-20 07:03:15,455 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-20 07:03:15,455 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-20 07:03:15,466 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-20 07:03:15,468 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-20 07:03:15,471 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-20 07:03:15,473 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-20 07:03:15,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-20 07:03:15,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-20 07:03:15,481 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-20 07:03:15,481 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-20 07:03:15,485 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-20 07:03:15,487 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-20 07:03:15,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-20 07:03:15,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-20 07:03:15,491 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-20 07:03:15,494 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-20 07:03:15,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-20 07:03:15,504 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-20 07:03:15,506 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-20 07:03:15,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-20 07:03:15,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-20 07:03:15,512 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-20 07:03:15,512 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-20 07:03:15,512 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-20 07:03:15,515 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-20 07:03:15,515 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-20 07:03:15,516 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-20 07:03:15,516 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-20 07:03:15,517 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-20 07:03:15,518 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-20 07:03:15,519 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-20 07:03:15,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-20 07:03:15,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-20 07:03:15,521 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-20 07:03:15,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-20 07:03:15,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-20 07:03:15,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-20 07:03:15,524 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-20 07:03:15,525 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2020-10-20 07:03:15,578 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-20 07:03:15,578 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-20 07:03:15,580 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-20 07:03:15,580 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-20 07:03:15,580 INFO L138 SettingsManager]: * Use SBE=true [2020-10-20 07:03:15,581 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2020-10-20 07:03:15,581 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2020-10-20 07:03:15,581 INFO L138 SettingsManager]: * Use old map elimination=false [2020-10-20 07:03:15,581 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2020-10-20 07:03:15,581 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2020-10-20 07:03:15,582 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2020-10-20 07:03:15,583 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-20 07:03:15,583 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-20 07:03:15,583 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2020-10-20 07:03:15,584 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-20 07:03:15,584 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-20 07:03:15,584 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-20 07:03:15,584 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2020-10-20 07:03:15,584 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2020-10-20 07:03:15,584 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2020-10-20 07:03:15,585 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-20 07:03:15,585 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-20 07:03:15,585 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2020-10-20 07:03:15,585 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-20 07:03:15,585 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2020-10-20 07:03:15,586 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-20 07:03:15,586 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-20 07:03:15,586 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2020-10-20 07:03:15,586 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-20 07:03:15,586 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-20 07:03:15,587 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-10-20 07:03:15,587 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2020-10-20 07:03:15,589 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2020-10-20 07:03:15,589 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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 25b1595a40c04d1f29f2431a3990f69b3ca92105 [2020-10-20 07:03:15,816 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-20 07:03:15,835 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-20 07:03:15,841 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-20 07:03:15,845 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-20 07:03:15,846 INFO L275 PluginConnector]: CDTParser initialized [2020-10-20 07:03:15,846 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1.c [2020-10-20 07:03:15,911 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3e8d8f4/3c3832dc44d64250a2141d3798e68bb3/FLAG146193465 [2020-10-20 07:03:16,402 INFO L306 CDTParser]: Found 1 translation units. [2020-10-20 07:03:16,404 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1.c [2020-10-20 07:03:16,411 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3e8d8f4/3c3832dc44d64250a2141d3798e68bb3/FLAG146193465 [2020-10-20 07:03:16,770 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f3e8d8f4/3c3832dc44d64250a2141d3798e68bb3 [2020-10-20 07:03:16,773 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-20 07:03:16,780 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-10-20 07:03:16,781 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-20 07:03:16,781 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-20 07:03:16,784 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-20 07:03:16,785 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:03:16" (1/1) ... [2020-10-20 07:03:16,789 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e31e559 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:16, skipping insertion in model container [2020-10-20 07:03:16,789 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.10 07:03:16" (1/1) ... [2020-10-20 07:03:16,798 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-20 07:03:16,820 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-20 07:03:17,062 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:03:17,072 INFO L203 MainTranslator]: Completed pre-run [2020-10-20 07:03:17,093 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-20 07:03:17,111 INFO L208 MainTranslator]: Completed translation [2020-10-20 07:03:17,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17 WrapperNode [2020-10-20 07:03:17,112 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-20 07:03:17,113 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-20 07:03:17,113 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-20 07:03:17,113 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-20 07:03:17,122 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (1/1) ... [2020-10-20 07:03:17,130 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (1/1) ... [2020-10-20 07:03:17,155 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-20 07:03:17,156 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-20 07:03:17,156 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-20 07:03:17,156 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-20 07:03:17,167 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (1/1) ... [2020-10-20 07:03:17,167 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (1/1) ... [2020-10-20 07:03:17,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (1/1) ... [2020-10-20 07:03:17,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (1/1) ... [2020-10-20 07:03:17,177 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (1/1) ... [2020-10-20 07:03:17,182 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (1/1) ... [2020-10-20 07:03:17,185 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (1/1) ... [2020-10-20 07:03:17,188 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-20 07:03:17,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-20 07:03:17,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-20 07:03:17,189 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-20 07:03:17,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (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-20 07:03:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-10-20 07:03:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-20 07:03:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-20 07:03:17,261 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-20 07:03:17,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-20 07:03:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-10-20 07:03:17,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-20 07:03:17,562 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-20 07:03:17,562 INFO L298 CfgBuilder]: Removed 12 assume(true) statements. [2020-10-20 07:03:17,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:03:17 BoogieIcfgContainer [2020-10-20 07:03:17,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-20 07:03:17,565 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2020-10-20 07:03:17,565 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2020-10-20 07:03:17,569 INFO L275 PluginConnector]: BuchiAutomizer initialized [2020-10-20 07:03:17,569 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:03:17,570 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 20.10 07:03:16" (1/3) ... [2020-10-20 07:03:17,571 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@295765f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:03:17, skipping insertion in model container [2020-10-20 07:03:17,571 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:03:17,571 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.10 07:03:17" (2/3) ... [2020-10-20 07:03:17,572 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@295765f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 20.10 07:03:17, skipping insertion in model container [2020-10-20 07:03:17,572 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2020-10-20 07:03:17,572 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:03:17" (3/3) ... [2020-10-20 07:03:17,576 INFO L373 chiAutomizerObserver]: Analyzing ICFG insertion_sort-1.c [2020-10-20 07:03:17,650 INFO L359 BuchiCegarLoop]: Interprodecural is true [2020-10-20 07:03:17,650 INFO L360 BuchiCegarLoop]: Hoare is false [2020-10-20 07:03:17,650 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2020-10-20 07:03:17,651 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-20 07:03:17,651 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-20 07:03:17,651 INFO L364 BuchiCegarLoop]: Difference is false [2020-10-20 07:03:17,651 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-20 07:03:17,652 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2020-10-20 07:03:17,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-20 07:03:17,707 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-10-20 07:03:17,707 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:17,708 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:17,731 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:03:17,731 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:03:17,731 INFO L427 BuchiCegarLoop]: ======== Iteration 1============ [2020-10-20 07:03:17,731 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states. [2020-10-20 07:03:17,734 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 16 [2020-10-20 07:03:17,734 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:17,735 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:17,735 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2020-10-20 07:03:17,735 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2020-10-20 07:03:17,742 INFO L794 eck$LassoCheckResult]: Stem: 18#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 14#L-1true havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 24#L17-3true [2020-10-20 07:03:17,742 INFO L796 eck$LassoCheckResult]: Loop: 24#L17-3true assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3#L17-2true main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 24#L17-3true [2020-10-20 07:03:17,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:17,748 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2020-10-20 07:03:17,757 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:17,757 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646523996] [2020-10-20 07:03:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:17,901 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:17,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:17,943 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:17,983 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:17,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:17,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2020-10-20 07:03:17,986 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:17,988 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484749469] [2020-10-20 07:03:17,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:18,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:18,018 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:18,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:18,046 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:18,054 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:18,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:18,060 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2020-10-20 07:03:18,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:18,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423057075] [2020-10-20 07:03:18,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:18,128 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:18,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:18,168 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:18,569 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 77 [2020-10-20 07:03:18,730 WARN L193 SmtUtils]: Spent 128.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2020-10-20 07:03:18,743 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:03:18,744 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:03:18,745 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:03:18,745 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:03:18,745 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:03:18,745 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:18,746 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:03:18,746 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:03:18,746 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration1_Lasso [2020-10-20 07:03:18,746 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:03:18,747 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:03:18,774 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-20 07:03:18,782 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-20 07:03:18,787 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-20 07:03:18,806 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-20 07:03:18,809 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-20 07:03:18,812 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-20 07:03:18,816 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-20 07:03:18,820 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-20 07:03:18,823 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-20 07:03:18,827 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-20 07:03:18,830 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-20 07:03:18,834 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-20 07:03:18,837 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-20 07:03:18,840 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-20 07:03:18,844 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-20 07:03:18,847 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-20 07:03:18,850 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-20 07:03:19,292 WARN L193 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 60 [2020-10-20 07:03:19,327 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-20 07:03:19,330 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-20 07:03:19,923 WARN L193 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2020-10-20 07:03:20,012 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:03:20,019 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) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,027 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-20 07:03:20,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,030 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,031 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,031 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,031 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,034 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,034 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,037 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-20 07:03:20,084 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-20 07:03:20,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,091 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:20,091 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:20,104 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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) [2020-10-20 07:03:20,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-20 07:03:20,143 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,143 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,143 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,143 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,144 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,145 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,145 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,151 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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,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-20 07:03:20,180 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,180 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,180 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,180 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,180 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,181 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,181 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,189 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-20 07:03:20,212 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-20 07:03:20,214 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,214 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,218 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,218 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,219 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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,253 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-20 07:03:20,255 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,259 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:20,259 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:20,264 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-20 07:03:20,295 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-20 07:03:20,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,299 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,299 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,301 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-20 07:03:20,335 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-20 07:03:20,337 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,337 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,338 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,338 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,338 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,339 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,339 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,346 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) [2020-10-20 07:03:20,384 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-20 07:03:20,386 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,386 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,386 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,386 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,389 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:20,390 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:20,394 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) [2020-10-20 07:03:20,419 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,421 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,421 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,421 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,421 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,422 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,424 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) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,456 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-20 07:03:20,457 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,457 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,457 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,458 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,458 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,460 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) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,491 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-20 07:03:20,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,493 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,496 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) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,521 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-20 07:03:20,522 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,523 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,523 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,523 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,523 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,523 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,523 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,525 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-20 07:03:20,549 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-20 07:03:20,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,551 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,551 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,551 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,553 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-20 07:03:20,579 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-20 07:03:20,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,580 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,581 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,581 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,586 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-20 07:03:20,610 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-20 07:03:20,611 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,611 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:20,612 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,612 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,612 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,612 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:20,612 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:20,615 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 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-20 07:03:20,638 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-20 07:03:20,639 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,639 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,639 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,639 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,641 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:20,642 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:20,650 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 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,679 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-20 07:03:20,682 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,682 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,682 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,682 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,684 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:20,685 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:20,693 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 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,723 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-20 07:03:20,724 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,725 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,725 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,725 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,733 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:20,733 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:20,737 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 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,765 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-20 07:03:20,766 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,767 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,767 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,767 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,770 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:20,770 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:20,785 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) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,809 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-20 07:03:20,810 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,811 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,811 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,811 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,813 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:20,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:20,818 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 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:20,840 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-20 07:03:20,843 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,843 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,844 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,844 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,846 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:20,846 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,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 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:20,886 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-20 07:03:20,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:20,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,891 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:20,891 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,895 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:20,923 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:20,925 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:20,928 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2020-10-20 07:03:20,928 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:20,928 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:20,939 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2020-10-20 07:03:20,939 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:20,958 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:03:20,998 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-20 07:03:20,999 INFO L444 ModelExtractionUtils]: 4 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. 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) [2020-10-20 07:03:21,005 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:21,010 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:03:21,010 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:03:21,011 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1, ULTIMATE.start_main_~j~0, ULTIMATE.start_main_~#v~0.offset) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_1 - 4*ULTIMATE.start_main_~j~0 - 1*ULTIMATE.start_main_~#v~0.offset Supporting invariants [] [2020-10-20 07:03:21,095 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2020-10-20 07:03:21,110 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:03:21,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:21,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:03:21,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:21,176 INFO L263 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:03:21,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:21,193 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-20 07:03:21,212 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-20 07:03:21,213 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states. Second operand 3 states. [2020-10-20 07:03:21,279 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states.. Second operand 3 states. Result 47 states and 69 transitions. Complement of second has 8 states. [2020-10-20 07:03:21,280 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-20 07:03:21,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:03:21,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 34 transitions. [2020-10-20 07:03:21,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 2 letters. [2020-10-20 07:03:21,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:21,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 4 letters. Loop has 2 letters. [2020-10-20 07:03:21,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:21,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 34 transitions. Stem has 2 letters. Loop has 4 letters. [2020-10-20 07:03:21,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:21,295 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 69 transitions. [2020-10-20 07:03:21,305 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 07:03:21,312 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 21 states and 30 transitions. [2020-10-20 07:03:21,317 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 07:03:21,318 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 07:03:21,319 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 30 transitions. [2020-10-20 07:03:21,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:21,320 INFO L691 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-10-20 07:03:21,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 30 transitions. [2020-10-20 07:03:21,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2020-10-20 07:03:21,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2020-10-20 07:03:21,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 30 transitions. [2020-10-20 07:03:21,396 INFO L714 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-10-20 07:03:21,397 INFO L594 BuchiCegarLoop]: Abstraction has 21 states and 30 transitions. [2020-10-20 07:03:21,397 INFO L427 BuchiCegarLoop]: ======== Iteration 2============ [2020-10-20 07:03:21,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 30 transitions. [2020-10-20 07:03:21,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 14 [2020-10-20 07:03:21,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:21,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:21,398 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:03:21,399 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:03:21,399 INFO L794 eck$LassoCheckResult]: Stem: 174#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 171#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 172#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 175#L17-4 main_~j~0 := 1; 160#L19-3 [2020-10-20 07:03:21,399 INFO L796 eck$LassoCheckResult]: Loop: 160#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 161#L22-5 assume !true; 162#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 163#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 160#L19-3 [2020-10-20 07:03:21,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:21,400 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 1 times [2020-10-20 07:03:21,400 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:21,400 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216609469] [2020-10-20 07:03:21,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:21,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:21,420 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:21,437 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:21,441 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:21,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:21,442 INFO L82 PathProgramCache]: Analyzing trace with hash 1687228, now seen corresponding path program 1 times [2020-10-20 07:03:21,442 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:21,442 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510119180] [2020-10-20 07:03:21,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:21,467 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-20 07:03:21,467 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510119180] [2020-10-20 07:03:21,468 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:03:21,468 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-20 07:03:21,469 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664566742] [2020-10-20 07:03:21,472 INFO L811 eck$LassoCheckResult]: loop already infeasible [2020-10-20 07:03:21,473 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:21,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-10-20 07:03:21,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-10-20 07:03:21,477 INFO L87 Difference]: Start difference. First operand 21 states and 30 transitions. cyclomatic complexity: 12 Second operand 2 states. [2020-10-20 07:03:21,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:21,483 INFO L93 Difference]: Finished difference Result 20 states and 26 transitions. [2020-10-20 07:03:21,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-10-20 07:03:21,484 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 26 transitions. [2020-10-20 07:03:21,486 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-20 07:03:21,486 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 19 states and 25 transitions. [2020-10-20 07:03:21,487 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 07:03:21,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 07:03:21,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 25 transitions. [2020-10-20 07:03:21,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:21,488 INFO L691 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-20 07:03:21,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 25 transitions. [2020-10-20 07:03:21,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2020-10-20 07:03:21,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 07:03:21,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 25 transitions. [2020-10-20 07:03:21,490 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-20 07:03:21,491 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 25 transitions. [2020-10-20 07:03:21,491 INFO L427 BuchiCegarLoop]: ======== Iteration 3============ [2020-10-20 07:03:21,491 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 25 transitions. [2020-10-20 07:03:21,492 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-20 07:03:21,492 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:21,492 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:21,493 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2020-10-20 07:03:21,493 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:03:21,493 INFO L794 eck$LassoCheckResult]: Stem: 218#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 215#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 216#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 219#L17-4 main_~j~0 := 1; 208#L19-3 [2020-10-20 07:03:21,493 INFO L796 eck$LassoCheckResult]: Loop: 208#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 209#L22-5 main_#t~short13 := main_~i~0 >= 0; 212#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 213#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 206#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 207#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 208#L19-3 [2020-10-20 07:03:21,494 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:21,494 INFO L82 PathProgramCache]: Analyzing trace with hash 925707, now seen corresponding path program 2 times [2020-10-20 07:03:21,494 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:21,494 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719052004] [2020-10-20 07:03:21,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:21,511 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:21,526 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:21,531 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:21,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:21,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1602376878, now seen corresponding path program 1 times [2020-10-20 07:03:21,532 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:21,532 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000105068] [2020-10-20 07:03:21,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:21,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:21,558 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:21,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:21,576 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:21,579 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:21,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:21,583 INFO L82 PathProgramCache]: Analyzing trace with hash 1970718008, now seen corresponding path program 1 times [2020-10-20 07:03:21,583 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:21,583 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93002046] [2020-10-20 07:03:21,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:21,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:21,756 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-20 07:03:21,757 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93002046] [2020-10-20 07:03:21,757 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:03:21,757 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:03:21,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791249434] [2020-10-20 07:03:21,909 WARN L193 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-10-20 07:03:21,956 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:21,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:03:21,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:03:21,957 INFO L87 Difference]: Start difference. First operand 19 states and 25 transitions. cyclomatic complexity: 9 Second operand 5 states. [2020-10-20 07:03:22,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:22,068 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2020-10-20 07:03:22,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:03:22,069 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2020-10-20 07:03:22,070 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-20 07:03:22,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 25 transitions. [2020-10-20 07:03:22,070 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2020-10-20 07:03:22,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2020-10-20 07:03:22,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 25 transitions. [2020-10-20 07:03:22,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:22,072 INFO L691 BuchiCegarLoop]: Abstraction has 20 states and 25 transitions. [2020-10-20 07:03:22,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 25 transitions. [2020-10-20 07:03:22,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2020-10-20 07:03:22,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2020-10-20 07:03:22,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2020-10-20 07:03:22,074 INFO L714 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-20 07:03:22,074 INFO L594 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2020-10-20 07:03:22,074 INFO L427 BuchiCegarLoop]: ======== Iteration 4============ [2020-10-20 07:03:22,074 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2020-10-20 07:03:22,076 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2020-10-20 07:03:22,076 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:22,076 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:22,077 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:03:22,077 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:03:22,077 INFO L794 eck$LassoCheckResult]: Stem: 273#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 270#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 271#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 256#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 257#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 274#L17-4 main_~j~0 := 1; 261#L19-3 [2020-10-20 07:03:22,077 INFO L796 eck$LassoCheckResult]: Loop: 261#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 262#L22-5 main_#t~short13 := main_~i~0 >= 0; 267#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 268#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 263#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 264#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 261#L19-3 [2020-10-20 07:03:22,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:22,078 INFO L82 PathProgramCache]: Analyzing trace with hash 889660429, now seen corresponding path program 1 times [2020-10-20 07:03:22,078 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:22,078 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276268584] [2020-10-20 07:03:22,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:22,094 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:22,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:22,107 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:22,112 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:22,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:22,112 INFO L82 PathProgramCache]: Analyzing trace with hash 1602376878, now seen corresponding path program 2 times [2020-10-20 07:03:22,113 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:22,113 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887446006] [2020-10-20 07:03:22,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:22,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:22,122 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:22,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:22,130 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:22,133 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:22,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:22,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1315520442, now seen corresponding path program 1 times [2020-10-20 07:03:22,134 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:22,134 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994588293] [2020-10-20 07:03:22,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:22,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:22,317 WARN L193 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 36 [2020-10-20 07:03:22,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:22,343 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994588293] [2020-10-20 07:03:22,344 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051990987] [2020-10-20 07:03:22,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:22,388 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 11 conjunts are in the unsatisfiable core [2020-10-20 07:03:22,390 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:22,433 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2020-10-20 07:03:22,434 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:22,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:22,471 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2020-10-20 07:03:22,471 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:22,498 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:22,499 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-20 07:03:22,499 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:46 [2020-10-20 07:03:22,613 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 07:03:22,673 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-20 07:03:23,034 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 109 treesize of output 89 [2020-10-20 07:03:23,127 INFO L545 ElimStorePlain]: Start of recursive call 2: 5 dim-0 vars, End of recursive call: 5 dim-0 vars, and 1 xjuncts. [2020-10-20 07:03:23,244 WARN L193 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 53 [2020-10-20 07:03:23,246 INFO L625 ElimStorePlain]: treesize reduction 22, result has 87.6 percent of original size [2020-10-20 07:03:23,337 INFO L545 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, End of recursive call: 8 dim-0 vars, and 1 xjuncts. [2020-10-20 07:03:23,338 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 6 variables, input treesize:126, output treesize:145 [2020-10-20 07:03:23,608 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:03:23,627 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2020-10-20 07:03:23,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:23,821 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:23,821 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2020-10-20 07:03:23,821 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964171707] [2020-10-20 07:03:23,947 WARN L193 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-10-20 07:03:23,985 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:23,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-10-20 07:03:23,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2020-10-20 07:03:23,986 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 8 Second operand 11 states. [2020-10-20 07:03:29,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:29,597 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-10-20 07:03:29,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 07:03:29,598 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 32 transitions. [2020-10-20 07:03:29,599 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-10-20 07:03:29,600 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 23 states and 28 transitions. [2020-10-20 07:03:29,600 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 07:03:29,600 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2020-10-20 07:03:29,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 28 transitions. [2020-10-20 07:03:29,600 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:03:29,601 INFO L691 BuchiCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-10-20 07:03:29,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 28 transitions. [2020-10-20 07:03:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 22. [2020-10-20 07:03:29,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-10-20 07:03:29,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2020-10-20 07:03:29,603 INFO L714 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-20 07:03:29,603 INFO L594 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2020-10-20 07:03:29,603 INFO L427 BuchiCegarLoop]: ======== Iteration 5============ [2020-10-20 07:03:29,603 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 27 transitions. [2020-10-20 07:03:29,604 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2020-10-20 07:03:29,604 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:29,604 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:29,605 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1] [2020-10-20 07:03:29,605 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:03:29,605 INFO L794 eck$LassoCheckResult]: Stem: 372#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 368#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 369#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 355#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 356#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 375#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 376#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 374#L17-4 main_~j~0 := 1; 360#L19-3 [2020-10-20 07:03:29,605 INFO L796 eck$LassoCheckResult]: Loop: 360#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 361#L22-5 main_#t~short13 := main_~i~0 >= 0; 366#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 371#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 362#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 363#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 360#L19-3 [2020-10-20 07:03:29,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:29,605 INFO L82 PathProgramCache]: Analyzing trace with hash 265236367, now seen corresponding path program 2 times [2020-10-20 07:03:29,606 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:29,606 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415385329] [2020-10-20 07:03:29,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:29,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:29,619 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:29,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:29,631 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:29,635 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:29,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:29,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1602376878, now seen corresponding path program 3 times [2020-10-20 07:03:29,636 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:29,636 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085427838] [2020-10-20 07:03:29,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:29,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:29,643 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:29,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:29,648 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:29,651 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:29,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:29,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1264115268, now seen corresponding path program 2 times [2020-10-20 07:03:29,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:29,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139314011] [2020-10-20 07:03:29,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:29,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:29,671 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:29,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:29,687 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:29,692 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:29,815 WARN L193 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 53 [2020-10-20 07:03:30,284 WARN L193 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 106 [2020-10-20 07:03:30,570 WARN L193 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 78 [2020-10-20 07:03:30,580 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:03:30,581 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:03:30,581 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:03:30,581 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:03:30,581 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:03:30,581 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:30,581 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:03:30,581 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:03:30,581 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration5_Lasso [2020-10-20 07:03:30,581 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:03:30,581 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:03:30,587 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-20 07:03:30,591 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-20 07:03:30,593 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-20 07:03:30,600 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-20 07:03:30,603 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-20 07:03:30,606 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-20 07:03:30,608 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-20 07:03:30,613 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-20 07:03:30,615 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-20 07:03:30,620 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-20 07:03:30,625 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-20 07:03:30,628 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-20 07:03:30,633 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-20 07:03:30,635 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-20 07:03:30,637 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-20 07:03:30,640 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-20 07:03:30,917 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-20 07:03:30,920 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-20 07:03:31,421 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:03:31,422 INFO L489 LassoAnalysis]: Using template 'affine'. 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-20 07:03:31,438 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-20 07:03:31,439 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,439 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,439 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,439 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,441 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:31,441 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:31,447 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-20 07:03:31,478 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-20 07:03:31,479 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,480 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,480 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,480 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,480 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,480 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,480 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,481 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-20 07:03:31,510 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-20 07:03:31,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,512 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,512 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,512 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,513 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:31,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:31,517 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) [2020-10-20 07:03:31,540 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:31,541 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,541 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,541 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,541 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,542 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,542 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,542 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,547 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) [2020-10-20 07:03:31,569 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:31,570 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,570 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,571 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,571 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,573 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) [2020-10-20 07:03:31,600 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-20 07:03:31,602 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,602 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,603 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,603 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:31,605 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-20 07:03:31,630 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-20 07:03:31,632 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,632 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,632 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,632 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,632 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,632 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,633 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,634 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-20 07:03:31,661 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-20 07:03:31,662 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,662 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,663 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,663 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,664 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:31,665 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:31,669 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-20 07:03:31,696 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-20 07:03:31,697 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,697 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,697 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,697 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,698 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,698 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,698 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,699 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) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:31,722 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-20 07:03:31,723 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,723 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,724 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,724 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,724 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,724 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,724 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,726 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) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:31,752 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-20 07:03:31,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,755 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 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:31,778 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-20 07:03:31,780 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,780 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,780 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,780 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,780 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,781 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,781 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,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 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-20 07:03:31,805 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-20 07:03:31,806 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,806 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,806 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,806 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,807 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,807 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,807 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,808 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-20 07:03:31,838 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-20 07:03:31,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,843 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-20 07:03:31,865 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-20 07:03:31,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:31,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:31,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:31,869 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-20 07:03:31,898 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-20 07:03:31,900 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:31,900 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:31,900 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:31,900 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:31,906 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:31,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:31,931 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:03:31,959 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-20 07:03:31,959 INFO L444 ModelExtractionUtils]: 9 out of 19 variables were initially zero. Simplification set additionally 6 variables to zero. 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-20 07:03:31,965 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:03:31,967 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 07:03:31,968 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:03:31,968 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2, ULTIMATE.start_main_~j~0) = 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_2 - 2*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~#v~0.offset >= 0] [2020-10-20 07:03:32,030 INFO L297 tatePredicateManager]: 12 out of 13 supporting invariants were superfluous and have been removed [2020-10-20 07:03:32,033 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:03:32,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:32,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 07:03:32,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:32,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 07:03:32,101 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:32,120 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:03:32,192 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-20 07:03:32,192 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2020-10-20 07:03:32,192 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8 Second operand 6 states. [2020-10-20 07:03:32,397 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 22 states and 27 transitions. cyclomatic complexity: 8. Second operand 6 states. Result 50 states and 66 transitions. Complement of second has 11 states. [2020-10-20 07:03:32,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 07:03:32,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 07:03:32,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 31 transitions. [2020-10-20 07:03:32,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 8 letters. Loop has 6 letters. [2020-10-20 07:03:32,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:32,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 14 letters. Loop has 6 letters. [2020-10-20 07:03:32,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:32,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 31 transitions. Stem has 8 letters. Loop has 12 letters. [2020-10-20 07:03:32,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:32,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 66 transitions. [2020-10-20 07:03:32,404 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-20 07:03:32,404 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 42 states and 54 transitions. [2020-10-20 07:03:32,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-20 07:03:32,405 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2020-10-20 07:03:32,405 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 54 transitions. [2020-10-20 07:03:32,406 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:32,406 INFO L691 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-10-20 07:03:32,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states and 54 transitions. [2020-10-20 07:03:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2020-10-20 07:03:32,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-10-20 07:03:32,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 52 transitions. [2020-10-20 07:03:32,410 INFO L714 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2020-10-20 07:03:32,410 INFO L594 BuchiCegarLoop]: Abstraction has 40 states and 52 transitions. [2020-10-20 07:03:32,410 INFO L427 BuchiCegarLoop]: ======== Iteration 6============ [2020-10-20 07:03:32,410 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 52 transitions. [2020-10-20 07:03:32,411 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-20 07:03:32,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:32,412 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:32,412 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-20 07:03:32,412 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:03:32,413 INFO L794 eck$LassoCheckResult]: Stem: 588#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 582#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 583#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 592#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 593#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 563#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 564#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 590#L17-4 main_~j~0 := 1; 591#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 571#L22-5 [2020-10-20 07:03:32,413 INFO L796 eck$LassoCheckResult]: Loop: 571#L22-5 main_#t~short13 := main_~i~0 >= 0; 595#L22-1 assume !main_#t~short13; 594#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 566#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 567#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 570#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 571#L22-5 [2020-10-20 07:03:32,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:32,413 INFO L82 PathProgramCache]: Analyzing trace with hash -367607191, now seen corresponding path program 1 times [2020-10-20 07:03:32,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:32,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1838744271] [2020-10-20 07:03:32,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:32,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:32,428 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:32,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:32,440 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:32,444 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:32,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash 1750331510, now seen corresponding path program 1 times [2020-10-20 07:03:32,445 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:32,445 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1064635309] [2020-10-20 07:03:32,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:32,450 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:32,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:32,455 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:32,457 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:32,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:32,458 INFO L82 PathProgramCache]: Analyzing trace with hash -531020578, now seen corresponding path program 1 times [2020-10-20 07:03:32,458 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:32,458 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243014694] [2020-10-20 07:03:32,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:32,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:32,486 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-10-20 07:03:32,486 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243014694] [2020-10-20 07:03:32,486 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:03:32,486 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:03:32,487 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392349479] [2020-10-20 07:03:32,607 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:32,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:03:32,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:03:32,608 INFO L87 Difference]: Start difference. First operand 40 states and 52 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-10-20 07:03:32,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:32,699 INFO L93 Difference]: Finished difference Result 78 states and 99 transitions. [2020-10-20 07:03:32,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 07:03:32,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 99 transitions. [2020-10-20 07:03:32,703 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 30 [2020-10-20 07:03:32,704 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 99 transitions. [2020-10-20 07:03:32,704 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 42 [2020-10-20 07:03:32,707 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 42 [2020-10-20 07:03:32,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 99 transitions. [2020-10-20 07:03:32,708 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:32,708 INFO L691 BuchiCegarLoop]: Abstraction has 78 states and 99 transitions. [2020-10-20 07:03:32,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 99 transitions. [2020-10-20 07:03:32,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 42. [2020-10-20 07:03:32,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2020-10-20 07:03:32,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 54 transitions. [2020-10-20 07:03:32,719 INFO L714 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-10-20 07:03:32,720 INFO L594 BuchiCegarLoop]: Abstraction has 42 states and 54 transitions. [2020-10-20 07:03:32,720 INFO L427 BuchiCegarLoop]: ======== Iteration 7============ [2020-10-20 07:03:32,720 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 54 transitions. [2020-10-20 07:03:32,721 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-20 07:03:32,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:32,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:32,722 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1] [2020-10-20 07:03:32,723 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:03:32,723 INFO L794 eck$LassoCheckResult]: Stem: 723#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 717#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 718#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 726#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 727#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 695#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 696#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 725#L17-4 main_~j~0 := 1; 698#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 699#L22-5 [2020-10-20 07:03:32,723 INFO L796 eck$LassoCheckResult]: Loop: 699#L22-5 main_#t~short13 := main_~i~0 >= 0; 709#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 714#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 715#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 719#L23-2 main_~i~0 := main_~i~0 - 1; 699#L22-5 [2020-10-20 07:03:32,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:32,724 INFO L82 PathProgramCache]: Analyzing trace with hash -367607191, now seen corresponding path program 2 times [2020-10-20 07:03:32,724 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:32,724 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236479114] [2020-10-20 07:03:32,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:32,752 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:32,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:32,775 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:32,782 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:32,785 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 1 times [2020-10-20 07:03:32,785 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:32,786 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952318649] [2020-10-20 07:03:32,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:32,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:32,793 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:32,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:32,798 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:32,800 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:32,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:32,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1264113600, now seen corresponding path program 1 times [2020-10-20 07:03:32,802 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:32,803 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739885583] [2020-10-20 07:03:32,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:32,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:32,824 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:32,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:32,842 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:32,851 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:33,411 WARN L193 SmtUtils]: Spent 442.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 120 [2020-10-20 07:03:33,754 WARN L193 SmtUtils]: Spent 332.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 91 [2020-10-20 07:03:33,757 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:03:33,758 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:03:33,758 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:03:33,758 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:03:33,758 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:03:33,758 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:33,758 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:03:33,759 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:03:33,759 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration7_Lasso [2020-10-20 07:03:33,759 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:03:33,759 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:03:33,763 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-20 07:03:33,781 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-20 07:03:33,783 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-20 07:03:34,068 WARN L193 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 59 [2020-10-20 07:03:34,134 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-20 07:03:34,138 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-20 07:03:34,141 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-20 07:03:34,145 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-20 07:03:34,148 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-20 07:03:34,152 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-20 07:03:34,154 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-20 07:03:34,156 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-20 07:03:34,160 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-20 07:03:34,162 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-20 07:03:34,166 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-20 07:03:34,168 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-20 07:03:34,172 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-20 07:03:34,175 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-20 07:03:34,178 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-20 07:03:34,560 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:03:34,561 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2020-10-20 07:03:34,569 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-20 07:03:34,571 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:34,571 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:34,571 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:34,571 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:34,571 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:34,572 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:34,572 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:34,574 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-20 07:03:34,602 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-20 07:03:34,603 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:34,603 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:34,603 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:34,603 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:34,603 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:34,604 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:34,604 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:34,606 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) [2020-10-20 07:03:34,628 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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:34,629 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:34,629 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:34,629 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:34,629 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:34,631 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:34,631 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:34,634 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-20 07:03:34,655 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-20 07:03:34,657 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:34,658 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:34,658 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:34,658 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:34,661 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:34,662 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:34,671 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:03:34,704 INFO L443 ModelExtractionUtils]: Simplification made 15 calls to the SMT solver. [2020-10-20 07:03:34,704 INFO L444 ModelExtractionUtils]: 5 out of 22 variables were initially zero. Simplification set additionally 12 variables to zero. 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-20 07:03:34,707 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:03:34,709 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2020-10-20 07:03:34,709 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:03:34,709 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 2*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 Supporting invariants [1*ULTIMATE.start_main_~j~0 - 1 >= 0] [2020-10-20 07:03:34,790 INFO L297 tatePredicateManager]: 14 out of 15 supporting invariants were superfluous and have been removed [2020-10-20 07:03:34,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:34,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:34,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 3 conjunts are in the unsatisfiable core [2020-10-20 07:03:34,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:34,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:34,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:03:34,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:34,944 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-20 07:03:34,944 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2020-10-20 07:03:34,944 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 17 Second operand 5 states. [2020-10-20 07:03:35,023 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 54 transitions. cyclomatic complexity: 17. Second operand 5 states. Result 77 states and 97 transitions. Complement of second has 10 states. [2020-10-20 07:03:35,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 07:03:35,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 07:03:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2020-10-20 07:03:35,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 9 letters. Loop has 5 letters. [2020-10-20 07:03:35,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:35,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 14 letters. Loop has 5 letters. [2020-10-20 07:03:35,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:35,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 9 letters. Loop has 10 letters. [2020-10-20 07:03:35,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:35,027 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 77 states and 97 transitions. [2020-10-20 07:03:35,028 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2020-10-20 07:03:35,029 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 77 states to 60 states and 75 transitions. [2020-10-20 07:03:35,029 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2020-10-20 07:03:35,030 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 26 [2020-10-20 07:03:35,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 75 transitions. [2020-10-20 07:03:35,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:35,030 INFO L691 BuchiCegarLoop]: Abstraction has 60 states and 75 transitions. [2020-10-20 07:03:35,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states and 75 transitions. [2020-10-20 07:03:35,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 48. [2020-10-20 07:03:35,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 07:03:35,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2020-10-20 07:03:35,035 INFO L714 BuchiCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-20 07:03:35,035 INFO L594 BuchiCegarLoop]: Abstraction has 48 states and 63 transitions. [2020-10-20 07:03:35,035 INFO L427 BuchiCegarLoop]: ======== Iteration 8============ [2020-10-20 07:03:35,035 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 63 transitions. [2020-10-20 07:03:35,036 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-20 07:03:35,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:35,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:35,037 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 07:03:35,037 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:03:35,038 INFO L794 eck$LassoCheckResult]: Stem: 978#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 973#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 974#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 951#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 952#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 981#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 983#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 980#L17-4 main_~j~0 := 1; 954#L19-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 949#L19-4 main_~k~0 := 1; 950#L29-3 [2020-10-20 07:03:35,038 INFO L796 eck$LassoCheckResult]: Loop: 950#L29-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem16 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem17 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem16 <= main_#t~mem17 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 953#L6 assume !(0 == __VERIFIER_assert_~cond); 963#L6-2 havoc main_#t~mem16;havoc main_#t~mem17; 962#L29-2 main_#t~post15 := main_~k~0;main_~k~0 := 1 + main_#t~post15;havoc main_#t~post15; 950#L29-3 [2020-10-20 07:03:35,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:35,038 INFO L82 PathProgramCache]: Analyzing trace with hash 1489078962, now seen corresponding path program 1 times [2020-10-20 07:03:35,039 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:35,039 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302813286] [2020-10-20 07:03:35,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:35,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:35,195 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302813286] [2020-10-20 07:03:35,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150481817] [2020-10-20 07:03:35,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:35,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 8 conjunts are in the unsatisfiable core [2020-10-20 07:03:35,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:35,245 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2020-10-20 07:03:35,245 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:35,272 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:35,278 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2020-10-20 07:03:35,279 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:35,305 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:35,305 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-20 07:03:35,305 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:46 [2020-10-20 07:03:35,346 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:03:35,389 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:03:35,420 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 21 treesize of output 17 [2020-10-20 07:03:35,420 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:35,446 INFO L625 ElimStorePlain]: treesize reduction 21, result has 56.3 percent of original size [2020-10-20 07:03:35,449 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 19 treesize of output 15 [2020-10-20 07:03:35,450 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:35,463 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:35,464 INFO L545 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2020-10-20 07:03:35,465 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:57, output treesize:11 [2020-10-20 07:03:35,541 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:35,541 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:35,541 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2020-10-20 07:03:35,542 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688410962] [2020-10-20 07:03:35,542 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:35,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:35,542 INFO L82 PathProgramCache]: Analyzing trace with hash 2933516, now seen corresponding path program 1 times [2020-10-20 07:03:35,543 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:35,543 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661434837] [2020-10-20 07:03:35,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:35,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:35,551 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:35,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:35,556 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:35,560 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:35,677 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:35,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-10-20 07:03:35,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2020-10-20 07:03:35,678 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. cyclomatic complexity: 21 Second operand 10 states. [2020-10-20 07:03:36,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:36,008 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2020-10-20 07:03:36,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-20 07:03:36,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 65 transitions. [2020-10-20 07:03:36,010 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-20 07:03:36,011 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 65 transitions. [2020-10-20 07:03:36,011 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2020-10-20 07:03:36,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2020-10-20 07:03:36,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 65 transitions. [2020-10-20 07:03:36,012 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:36,012 INFO L691 BuchiCegarLoop]: Abstraction has 51 states and 65 transitions. [2020-10-20 07:03:36,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 65 transitions. [2020-10-20 07:03:36,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2020-10-20 07:03:36,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2020-10-20 07:03:36,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 62 transitions. [2020-10-20 07:03:36,016 INFO L714 BuchiCegarLoop]: Abstraction has 48 states and 62 transitions. [2020-10-20 07:03:36,016 INFO L594 BuchiCegarLoop]: Abstraction has 48 states and 62 transitions. [2020-10-20 07:03:36,016 INFO L427 BuchiCegarLoop]: ======== Iteration 9============ [2020-10-20 07:03:36,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 48 states and 62 transitions. [2020-10-20 07:03:36,017 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-20 07:03:36,017 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:36,017 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:36,019 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:03:36,019 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:03:36,019 INFO L794 eck$LassoCheckResult]: Stem: 1123#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1117#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 1118#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1094#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1095#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1127#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1129#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1126#L17-4 main_~j~0 := 1; 1099#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1100#L22-5 main_#t~short13 := main_~i~0 >= 0; 1120#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 1116#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1105#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1106#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1114#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1128#L22-5 [2020-10-20 07:03:36,019 INFO L796 eck$LassoCheckResult]: Loop: 1128#L22-5 main_#t~short13 := main_~i~0 >= 0; 1135#L22-1 assume !main_#t~short13; 1115#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1103#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1104#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1113#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1128#L22-5 [2020-10-20 07:03:36,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:36,020 INFO L82 PathProgramCache]: Analyzing trace with hash -532867620, now seen corresponding path program 3 times [2020-10-20 07:03:36,020 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:36,020 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251666510] [2020-10-20 07:03:36,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:36,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:36,262 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2020-10-20 07:03:36,309 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:36,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251666510] [2020-10-20 07:03:36,310 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345451922] [2020-10-20 07:03:36,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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-20 07:03:36,380 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-10-20 07:03:36,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:03:36,382 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 13 conjunts are in the unsatisfiable core [2020-10-20 07:03:36,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:36,405 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2020-10-20 07:03:36,406 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:36,432 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:36,437 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2020-10-20 07:03:36,437 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:36,462 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:36,463 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-20 07:03:36,463 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:46 [2020-10-20 07:03:36,593 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 07:03:36,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:36,737 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:36,737 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2020-10-20 07:03:36,737 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548989656] [2020-10-20 07:03:36,738 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:36,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:36,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1750331510, now seen corresponding path program 2 times [2020-10-20 07:03:36,738 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:36,738 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672356974] [2020-10-20 07:03:36,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:36,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:36,744 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:36,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:36,747 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:36,749 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:36,868 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:36,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-10-20 07:03:36,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2020-10-20 07:03:36,869 INFO L87 Difference]: Start difference. First operand 48 states and 62 transitions. cyclomatic complexity: 20 Second operand 14 states. [2020-10-20 07:03:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:37,458 INFO L93 Difference]: Finished difference Result 70 states and 89 transitions. [2020-10-20 07:03:37,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:03:37,459 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 70 states and 89 transitions. [2020-10-20 07:03:37,460 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 19 [2020-10-20 07:03:37,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 70 states to 70 states and 89 transitions. [2020-10-20 07:03:37,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 28 [2020-10-20 07:03:37,464 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2020-10-20 07:03:37,465 INFO L73 IsDeterministic]: Start isDeterministic. Operand 70 states and 89 transitions. [2020-10-20 07:03:37,465 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:37,465 INFO L691 BuchiCegarLoop]: Abstraction has 70 states and 89 transitions. [2020-10-20 07:03:37,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states and 89 transitions. [2020-10-20 07:03:37,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2020-10-20 07:03:37,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2020-10-20 07:03:37,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 83 transitions. [2020-10-20 07:03:37,479 INFO L714 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2020-10-20 07:03:37,479 INFO L594 BuchiCegarLoop]: Abstraction has 64 states and 83 transitions. [2020-10-20 07:03:37,479 INFO L427 BuchiCegarLoop]: ======== Iteration 10============ [2020-10-20 07:03:37,479 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 64 states and 83 transitions. [2020-10-20 07:03:37,480 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 15 [2020-10-20 07:03:37,480 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:37,480 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:37,481 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:03:37,483 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2020-10-20 07:03:37,483 INFO L794 eck$LassoCheckResult]: Stem: 1313#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1304#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 1305#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1316#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1337#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1336#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1334#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1332#L17-4 main_~j~0 := 1; 1330#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1324#L22-5 main_#t~short13 := main_~i~0 >= 0; 1306#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 1307#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1327#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1298#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1299#L19-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1281#L19-4 main_~k~0 := 1; 1282#L29-3 [2020-10-20 07:03:37,483 INFO L796 eck$LassoCheckResult]: Loop: 1282#L29-3 assume !!(main_~k~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem16 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * (main_~k~0 - 1), 4);call main_#t~mem17 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~k~0, 4);__VERIFIER_assert_#in~cond := (if main_#t~mem16 <= main_#t~mem17 then 1 else 0);havoc __VERIFIER_assert_~cond;__VERIFIER_assert_~cond := __VERIFIER_assert_#in~cond; 1283#L6 assume !(0 == __VERIFIER_assert_~cond); 1293#L6-2 havoc main_#t~mem16;havoc main_#t~mem17; 1292#L29-2 main_#t~post15 := main_~k~0;main_~k~0 := 1 + main_#t~post15;havoc main_#t~post15; 1282#L29-3 [2020-10-20 07:03:37,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:37,484 INFO L82 PathProgramCache]: Analyzing trace with hash 660972959, now seen corresponding path program 1 times [2020-10-20 07:03:37,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:37,485 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687871628] [2020-10-20 07:03:37,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:37,528 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:37,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:37,555 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:37,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:37,556 INFO L82 PathProgramCache]: Analyzing trace with hash 2933516, now seen corresponding path program 2 times [2020-10-20 07:03:37,557 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:37,557 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770486705] [2020-10-20 07:03:37,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:37,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:37,562 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:37,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:37,566 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:37,568 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:37,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:37,568 INFO L82 PathProgramCache]: Analyzing trace with hash 183134634, now seen corresponding path program 1 times [2020-10-20 07:03:37,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:37,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182571160] [2020-10-20 07:03:37,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:37,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:37,590 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:37,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:37,608 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:37,612 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:38,704 WARN L193 SmtUtils]: Spent 960.00 ms on a formula simplification. DAG size of input: 187 DAG size of output: 144 [2020-10-20 07:03:39,279 WARN L193 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 105 [2020-10-20 07:03:39,281 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:03:39,281 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:03:39,281 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:03:39,282 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:03:39,282 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:03:39,282 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:39,282 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:03:39,282 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:03:39,282 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration10_Lasso [2020-10-20 07:03:39,282 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:03:39,283 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:03:39,286 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-20 07:03:39,288 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-20 07:03:39,290 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-20 07:03:39,292 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-20 07:03:39,294 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-20 07:03:39,297 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-20 07:03:39,300 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-20 07:03:39,303 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-20 07:03:39,310 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-20 07:03:39,316 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-20 07:03:39,319 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-20 07:03:39,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-20 07:03:39,665 WARN L193 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 72 [2020-10-20 07:03:39,750 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-20 07:03:39,753 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-20 07:03:39,756 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-20 07:03:39,759 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-20 07:03:39,762 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-20 07:03:39,765 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-20 07:03:40,362 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:03:40,362 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:40,366 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-20 07:03:40,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,368 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:40,368 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,368 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,368 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:40,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,371 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 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:40,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-20 07:03:40,409 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,409 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:40,409 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,409 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,410 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,410 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:40,410 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,412 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 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:40,444 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-20 07:03:40,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,446 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:40,446 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,446 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,446 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,446 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:40,446 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:40,448 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 55 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 55 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,476 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-20 07:03:40,477 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,477 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,477 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,477 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,478 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:40,478 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:40,482 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 56 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 56 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,505 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-20 07:03:40,506 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,506 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:40,506 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,507 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,507 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,508 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:40,508 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:40,509 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 57 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,534 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-20 07:03:40,535 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,536 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,536 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,536 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,537 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:40,537 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:40,540 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:40,563 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 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,564 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,565 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,565 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,565 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,566 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:40,566 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:40,568 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 59 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 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,592 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-20 07:03:40,593 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,593 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:40,593 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,594 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:40,594 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:40,596 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 60 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 60 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,624 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-20 07:03:40,625 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,625 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:40,626 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,626 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,626 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,626 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:40,626 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:40,627 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 61 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 61 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,650 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-20 07:03:40,651 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,651 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:40,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,652 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:40,652 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:40,654 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 62 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 62 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,678 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-20 07:03:40,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:40,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:40,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:40,681 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 63 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 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,704 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-20 07:03:40,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:40,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:40,705 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:40,705 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:40,715 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:40,715 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:40,736 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:03:40,763 INFO L443 ModelExtractionUtils]: Simplification made 9 calls to the SMT solver. [2020-10-20 07:03:40,763 INFO L444 ModelExtractionUtils]: 8 out of 22 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 64 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:40,766 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:03:40,768 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:03:40,768 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:03:40,768 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~#v~0.offset, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_4, ULTIMATE.start_main_~k~0) = -1*ULTIMATE.start_main_~#v~0.offset + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_4 - 4*ULTIMATE.start_main_~k~0 Supporting invariants [] [2020-10-20 07:03:40,883 INFO L297 tatePredicateManager]: 18 out of 18 supporting invariants were superfluous and have been removed [2020-10-20 07:03:40,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:03:40,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:40,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:40,922 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:03:40,923 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:40,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:03:40,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:40,950 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-20 07:03:40,951 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-20 07:03:40,951 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26 Second operand 3 states. [2020-10-20 07:03:40,965 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 64 states and 83 transitions. cyclomatic complexity: 26. Second operand 3 states. Result 68 states and 88 transitions. Complement of second has 4 states. [2020-10-20 07:03:40,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 07:03:40,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:03:40,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 23 transitions. [2020-10-20 07:03:40,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 16 letters. Loop has 4 letters. [2020-10-20 07:03:40,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:40,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 20 letters. Loop has 4 letters. [2020-10-20 07:03:40,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:40,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 23 transitions. Stem has 16 letters. Loop has 8 letters. [2020-10-20 07:03:40,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:40,968 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 88 transitions. [2020-10-20 07:03:40,969 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-10-20 07:03:40,970 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 45 states and 57 transitions. [2020-10-20 07:03:40,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2020-10-20 07:03:40,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2020-10-20 07:03:40,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 45 states and 57 transitions. [2020-10-20 07:03:40,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:40,973 INFO L691 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-10-20 07:03:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states and 57 transitions. [2020-10-20 07:03:40,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2020-10-20 07:03:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-10-20 07:03:40,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 57 transitions. [2020-10-20 07:03:40,977 INFO L714 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-10-20 07:03:40,977 INFO L594 BuchiCegarLoop]: Abstraction has 45 states and 57 transitions. [2020-10-20 07:03:40,977 INFO L427 BuchiCegarLoop]: ======== Iteration 11============ [2020-10-20 07:03:40,977 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 57 transitions. [2020-10-20 07:03:40,978 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 11 [2020-10-20 07:03:40,978 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:40,978 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:40,979 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:03:40,979 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2020-10-20 07:03:40,979 INFO L794 eck$LassoCheckResult]: Stem: 1589#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1582#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 1583#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1563#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1564#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1591#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1596#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1594#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1593#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1590#L17-4 main_~j~0 := 1; 1569#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1570#L22-5 main_#t~short13 := main_~i~0 >= 0; 1584#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 1585#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1600#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1599#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1598#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1597#L22-5 [2020-10-20 07:03:40,979 INFO L796 eck$LassoCheckResult]: Loop: 1597#L22-5 main_#t~short13 := main_~i~0 >= 0; 1595#L22-1 assume !main_#t~short13; 1592#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1565#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1566#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1577#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1597#L22-5 [2020-10-20 07:03:40,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:40,980 INFO L82 PathProgramCache]: Analyzing trace with hash -610476902, now seen corresponding path program 4 times [2020-10-20 07:03:40,980 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:40,980 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952417913] [2020-10-20 07:03:40,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:40,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:40,996 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,010 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,014 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:41,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:41,015 INFO L82 PathProgramCache]: Analyzing trace with hash 1750331510, now seen corresponding path program 3 times [2020-10-20 07:03:41,015 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:41,016 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522241811] [2020-10-20 07:03:41,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,019 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,022 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,024 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:41,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:41,024 INFO L82 PathProgramCache]: Analyzing trace with hash -1753926065, now seen corresponding path program 1 times [2020-10-20 07:03:41,025 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:41,025 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137401784] [2020-10-20 07:03:41,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:41,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:41,070 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-20 07:03:41,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137401784] [2020-10-20 07:03:41,071 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343167949] [2020-10-20 07:03:41,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 65 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:41,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:41,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 07:03:41,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:41,131 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-10-20 07:03:41,138 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-10-20 07:03:41,138 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:41,138 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 07:03:41,138 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401209880] [2020-10-20 07:03:41,273 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:41,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 07:03:41,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-10-20 07:03:41,274 INFO L87 Difference]: Start difference. First operand 45 states and 57 transitions. cyclomatic complexity: 17 Second operand 7 states. [2020-10-20 07:03:41,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:41,403 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2020-10-20 07:03:41,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-20 07:03:41,404 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 50 states and 64 transitions. [2020-10-20 07:03:41,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 07:03:41,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 50 states to 50 states and 64 transitions. [2020-10-20 07:03:41,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 07:03:41,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 07:03:41,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 64 transitions. [2020-10-20 07:03:41,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:41,407 INFO L691 BuchiCegarLoop]: Abstraction has 50 states and 64 transitions. [2020-10-20 07:03:41,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states and 64 transitions. [2020-10-20 07:03:41,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 35. [2020-10-20 07:03:41,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2020-10-20 07:03:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 45 transitions. [2020-10-20 07:03:41,410 INFO L714 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 07:03:41,410 INFO L594 BuchiCegarLoop]: Abstraction has 35 states and 45 transitions. [2020-10-20 07:03:41,410 INFO L427 BuchiCegarLoop]: ======== Iteration 12============ [2020-10-20 07:03:41,411 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 35 states and 45 transitions. [2020-10-20 07:03:41,411 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:03:41,411 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:41,411 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:41,412 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-20 07:03:41,412 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:03:41,412 INFO L794 eck$LassoCheckResult]: Stem: 1763#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 1757#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 1758#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1766#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1767#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1742#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1743#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 1769#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 1768#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 1765#L17-4 main_~j~0 := 1; 1744#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1745#L22-5 main_#t~short13 := main_~i~0 >= 0; 1772#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 1770#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1749#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 1750#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 1746#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 1748#L22-5 [2020-10-20 07:03:41,413 INFO L796 eck$LassoCheckResult]: Loop: 1748#L22-5 main_#t~short13 := main_~i~0 >= 0; 1751#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 1753#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 1754#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 1760#L23-2 main_~i~0 := main_~i~0 - 1; 1748#L22-5 [2020-10-20 07:03:41,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:41,413 INFO L82 PathProgramCache]: Analyzing trace with hash -610476902, now seen corresponding path program 5 times [2020-10-20 07:03:41,413 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:41,414 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82689492] [2020-10-20 07:03:41,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:41,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,428 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,459 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,462 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:41,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 2 times [2020-10-20 07:03:41,463 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:41,464 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279016866] [2020-10-20 07:03:41,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,467 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,470 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,471 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:41,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:41,472 INFO L82 PathProgramCache]: Analyzing trace with hash 2021573807, now seen corresponding path program 1 times [2020-10-20 07:03:41,473 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:41,473 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549246910] [2020-10-20 07:03:41,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,489 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:41,506 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:41,511 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:42,632 WARN L193 SmtUtils]: Spent 1.02 s on a formula simplification. DAG size of input: 216 DAG size of output: 156 [2020-10-20 07:03:43,042 WARN L193 SmtUtils]: Spent 389.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 104 [2020-10-20 07:03:43,046 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:03:43,047 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:03:43,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:03:43,047 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:03:43,047 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:03:43,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:43,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:03:43,048 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:03:43,048 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration12_Lasso [2020-10-20 07:03:43,048 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:03:43,048 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:03:43,051 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-20 07:03:43,060 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-20 07:03:43,063 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-20 07:03:43,066 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-20 07:03:43,069 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-20 07:03:43,073 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-20 07:03:43,076 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-20 07:03:43,441 WARN L193 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 72 [2020-10-20 07:03:43,542 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-20 07:03:43,545 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-20 07:03:43,548 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-20 07:03:43,551 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-20 07:03:43,553 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-20 07:03:43,556 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-20 07:03:43,560 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-20 07:03:43,563 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-20 07:03:43,567 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-20 07:03:43,569 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-20 07:03:43,573 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-20 07:03:43,998 WARN L193 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 1 [2020-10-20 07:03:44,215 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:03:44,216 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 66 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,218 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-20 07:03:44,219 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,219 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,219 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,219 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,220 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:44,220 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:44,224 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 67 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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,246 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-20 07:03:44,247 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,247 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,247 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,247 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,248 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:44,248 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:44,252 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 68 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 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,275 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-20 07:03:44,276 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,277 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:44,277 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,277 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,277 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,277 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:44,277 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:44,279 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 69 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 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,300 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-20 07:03:44,301 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,301 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:44,301 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,301 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,301 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,302 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:44,302 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:44,303 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 70 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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,326 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-20 07:03:44,328 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,328 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:44,328 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,328 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,328 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,328 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:44,328 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:44,329 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 71 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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,352 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-20 07:03:44,353 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:44,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:44,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:44,355 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 72 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 72 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,378 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-20 07:03:44,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,380 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,381 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:44,382 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:44,387 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 73 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 73 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,410 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-20 07:03:44,411 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,411 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,411 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,411 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,413 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:44,413 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:44,420 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 74 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 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,441 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-20 07:03:44,442 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,442 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,443 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,443 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,444 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:44,444 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:44,450 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 75 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 75 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,472 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-20 07:03:44,473 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,473 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,473 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,473 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,474 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:44,474 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:44,477 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 76 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 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,501 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-20 07:03:44,502 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:44,503 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:44,503 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:44,503 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:44,508 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:44,508 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:44,519 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:03:44,532 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2020-10-20 07:03:44,533 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 11 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 77 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:44,535 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:03:44,537 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:03:44,537 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:03:44,537 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, ULTIMATE.start_main_~j~0) = 4*ULTIMATE.start_main_~i~0 + 1*ULTIMATE.start_main_~j~0 Supporting invariants [] [2020-10-20 07:03:44,652 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2020-10-20 07:03:44,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:44,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:44,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:03:44,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:44,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:44,789 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:03:44,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:44,834 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-20 07:03:44,834 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-10-20 07:03:44,834 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-20 07:03:44,870 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 35 states and 45 transitions. Complement of second has 4 states. [2020-10-20 07:03:44,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2020-10-20 07:03:44,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 07:03:44,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-10-20 07:03:44,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 5 letters. [2020-10-20 07:03:44,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:44,872 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:03:44,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:44,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:03:44,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:44,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:44,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:03:44,961 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:45,015 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-20 07:03:45,015 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2020-10-20 07:03:45,015 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-20 07:03:45,059 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 35 states and 45 transitions. Complement of second has 4 states. [2020-10-20 07:03:45,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 2 stem states 0 non-accepting loop states 1 accepting loop states [2020-10-20 07:03:45,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 07:03:45,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 7 transitions. [2020-10-20 07:03:45,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 7 transitions. Stem has 17 letters. Loop has 5 letters. [2020-10-20 07:03:45,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:45,063 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:03:45,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:45,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:45,118 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2020-10-20 07:03:45,120 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:45,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:45,155 INFO L263 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:03:45,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:45,205 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-20 07:03:45,206 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2020-10-20 07:03:45,206 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14 Second operand 6 states. [2020-10-20 07:03:45,362 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 35 states and 45 transitions. cyclomatic complexity: 14. Second operand 6 states. Result 73 states and 92 transitions. Complement of second has 12 states. [2020-10-20 07:03:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 3 non-accepting loop states 2 accepting loop states [2020-10-20 07:03:45,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-10-20 07:03:45,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 53 transitions. [2020-10-20 07:03:45,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 17 letters. Loop has 5 letters. [2020-10-20 07:03:45,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:45,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 22 letters. Loop has 5 letters. [2020-10-20 07:03:45,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:45,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 53 transitions. Stem has 17 letters. Loop has 10 letters. [2020-10-20 07:03:45,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:45,366 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 92 transitions. [2020-10-20 07:03:45,366 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:03:45,367 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 56 states and 70 transitions. [2020-10-20 07:03:45,368 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2020-10-20 07:03:45,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2020-10-20 07:03:45,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 70 transitions. [2020-10-20 07:03:45,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:45,369 INFO L691 BuchiCegarLoop]: Abstraction has 56 states and 70 transitions. [2020-10-20 07:03:45,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 70 transitions. [2020-10-20 07:03:45,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2020-10-20 07:03:45,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2020-10-20 07:03:45,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2020-10-20 07:03:45,372 INFO L714 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2020-10-20 07:03:45,372 INFO L594 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2020-10-20 07:03:45,372 INFO L427 BuchiCegarLoop]: ======== Iteration 13============ [2020-10-20 07:03:45,373 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2020-10-20 07:03:45,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:03:45,373 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:45,374 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:45,374 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2020-10-20 07:03:45,375 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:03:45,375 INFO L794 eck$LassoCheckResult]: Stem: 2296#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2291#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 2292#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2275#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2276#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2300#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2303#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2302#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2301#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 2299#L17-4 main_~j~0 := 1; 2277#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2278#L22-5 main_#t~short13 := main_~i~0 >= 0; 2308#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2307#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2306#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2305#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2279#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2280#L22-5 main_#t~short13 := main_~i~0 >= 0; 2293#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2290#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2281#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2282#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2287#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2283#L22-5 [2020-10-20 07:03:45,375 INFO L796 eck$LassoCheckResult]: Loop: 2283#L22-5 main_#t~short13 := main_~i~0 >= 0; 2284#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2288#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2289#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 2294#L23-2 main_~i~0 := main_~i~0 - 1; 2283#L22-5 [2020-10-20 07:03:45,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:45,376 INFO L82 PathProgramCache]: Analyzing trace with hash -1755773107, now seen corresponding path program 6 times [2020-10-20 07:03:45,376 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:45,376 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579577526] [2020-10-20 07:03:45,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:45,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:45,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579577526] [2020-10-20 07:03:45,813 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765080275] [2020-10-20 07:03:45,813 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 78 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:45,866 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2020-10-20 07:03:45,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:03:45,867 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjunts are in the unsatisfiable core [2020-10-20 07:03:45,868 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:46,127 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-20 07:03:46,128 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:46,128 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 18 [2020-10-20 07:03:46,128 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108425399] [2020-10-20 07:03:46,128 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:46,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:46,130 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 3 times [2020-10-20 07:03:46,130 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:46,130 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615878783] [2020-10-20 07:03:46,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:46,134 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:46,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:46,137 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:46,138 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:46,255 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:46,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-10-20 07:03:46,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2020-10-20 07:03:46,256 INFO L87 Difference]: Start difference. First operand 47 states and 61 transitions. cyclomatic complexity: 19 Second operand 19 states. [2020-10-20 07:03:47,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:47,178 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2020-10-20 07:03:47,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 07:03:47,178 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 122 transitions. [2020-10-20 07:03:47,179 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 07:03:47,180 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 69 states and 88 transitions. [2020-10-20 07:03:47,180 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 07:03:47,180 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 07:03:47,180 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 88 transitions. [2020-10-20 07:03:47,180 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:47,180 INFO L691 BuchiCegarLoop]: Abstraction has 69 states and 88 transitions. [2020-10-20 07:03:47,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 88 transitions. [2020-10-20 07:03:47,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 49. [2020-10-20 07:03:47,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2020-10-20 07:03:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2020-10-20 07:03:47,184 INFO L714 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2020-10-20 07:03:47,184 INFO L594 BuchiCegarLoop]: Abstraction has 49 states and 63 transitions. [2020-10-20 07:03:47,184 INFO L427 BuchiCegarLoop]: ======== Iteration 14============ [2020-10-20 07:03:47,184 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 63 transitions. [2020-10-20 07:03:47,185 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:03:47,185 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:47,185 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:47,186 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2020-10-20 07:03:47,186 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:03:47,186 INFO L794 eck$LassoCheckResult]: Stem: 2544#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2539#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 2540#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2523#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2524#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2547#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2552#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2551#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2550#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2549#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2548#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 2546#L17-4 main_~j~0 := 1; 2525#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2526#L22-5 main_#t~short13 := main_~i~0 >= 0; 2557#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2556#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2555#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2554#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2527#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2528#L22-5 main_#t~short13 := main_~i~0 >= 0; 2541#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2538#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2529#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2530#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2535#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2531#L22-5 [2020-10-20 07:03:47,186 INFO L796 eck$LassoCheckResult]: Loop: 2531#L22-5 main_#t~short13 := main_~i~0 >= 0; 2532#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2536#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2537#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 2542#L23-2 main_~i~0 := main_~i~0 - 1; 2531#L22-5 [2020-10-20 07:03:47,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:47,187 INFO L82 PathProgramCache]: Analyzing trace with hash -1134743541, now seen corresponding path program 7 times [2020-10-20 07:03:47,187 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:47,187 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642495877] [2020-10-20 07:03:47,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:47,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:47,210 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:47,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:47,231 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:47,235 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:47,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:47,236 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 4 times [2020-10-20 07:03:47,236 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:47,236 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360978573] [2020-10-20 07:03:47,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:47,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:47,239 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:47,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:47,243 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:47,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:47,244 INFO L82 PathProgramCache]: Analyzing trace with hash 1926098910, now seen corresponding path program 2 times [2020-10-20 07:03:47,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:47,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318659476] [2020-10-20 07:03:47,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:47,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:47,287 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-20 07:03:47,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318659476] [2020-10-20 07:03:47,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826433170] [2020-10-20 07:03:47,288 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 79 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:47,356 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 07:03:47,357 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:03:47,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 07:03:47,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-10-20 07:03:47,381 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:47,381 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2020-10-20 07:03:47,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511124970] [2020-10-20 07:03:47,489 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:47,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-20 07:03:47,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-20 07:03:47,491 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. cyclomatic complexity: 19 Second operand 7 states. [2020-10-20 07:03:47,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:47,633 INFO L93 Difference]: Finished difference Result 65 states and 81 transitions. [2020-10-20 07:03:47,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 07:03:47,634 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 81 transitions. [2020-10-20 07:03:47,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2020-10-20 07:03:47,636 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 81 transitions. [2020-10-20 07:03:47,636 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 07:03:47,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 07:03:47,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 81 transitions. [2020-10-20 07:03:47,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:47,637 INFO L691 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2020-10-20 07:03:47,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 81 transitions. [2020-10-20 07:03:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2020-10-20 07:03:47,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2020-10-20 07:03:47,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 70 transitions. [2020-10-20 07:03:47,649 INFO L714 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-10-20 07:03:47,649 INFO L594 BuchiCegarLoop]: Abstraction has 55 states and 70 transitions. [2020-10-20 07:03:47,649 INFO L427 BuchiCegarLoop]: ======== Iteration 15============ [2020-10-20 07:03:47,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 70 transitions. [2020-10-20 07:03:47,652 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:03:47,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:47,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:47,654 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 07:03:47,656 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:03:47,656 INFO L794 eck$LassoCheckResult]: Stem: 2767#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 2759#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 2760#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2772#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2773#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2742#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2743#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2777#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2776#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 2775#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 2774#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 2771#L17-4 main_~j~0 := 1; 2746#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2747#L22-5 main_#t~short13 := main_~i~0 >= 0; 2782#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2781#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2780#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2779#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2748#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2749#L22-5 main_#t~short13 := main_~i~0 >= 0; 2793#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2789#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2744#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 2745#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 2750#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 2778#L22-5 main_#t~short13 := main_~i~0 >= 0; 2764#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2765#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2768#L23 assume !(main_~i~0 < 2); 2761#L23-2 [2020-10-20 07:03:47,657 INFO L796 eck$LassoCheckResult]: Loop: 2761#L23-2 main_~i~0 := main_~i~0 - 1; 2751#L22-5 main_#t~short13 := main_~i~0 >= 0; 2752#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 2755#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 2756#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 2761#L23-2 [2020-10-20 07:03:47,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:47,660 INFO L82 PathProgramCache]: Analyzing trace with hash -353509773, now seen corresponding path program 1 times [2020-10-20 07:03:47,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:47,660 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044639632] [2020-10-20 07:03:47,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:47,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:47,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:47,746 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:47,752 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:47,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:47,753 INFO L82 PathProgramCache]: Analyzing trace with hash 72930612, now seen corresponding path program 5 times [2020-10-20 07:03:47,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:47,754 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282307701] [2020-10-20 07:03:47,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:47,759 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:47,766 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:47,769 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:47,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:47,770 INFO L82 PathProgramCache]: Analyzing trace with hash 2079206914, now seen corresponding path program 1 times [2020-10-20 07:03:47,770 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:47,771 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896203512] [2020-10-20 07:03:47,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:47,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:47,825 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:47,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:47,883 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:47,895 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:51,206 WARN L193 SmtUtils]: Spent 3.18 s on a formula simplification. DAG size of input: 311 DAG size of output: 204 [2020-10-20 07:03:51,773 WARN L193 SmtUtils]: Spent 537.00 ms on a formula simplification. DAG size of input: 146 DAG size of output: 117 [2020-10-20 07:03:51,781 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:03:51,781 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:03:51,781 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:03:51,781 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:03:51,781 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:03:51,781 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:51,781 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:03:51,781 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:03:51,781 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration15_Lasso [2020-10-20 07:03:51,782 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:03:51,782 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:03:51,784 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-20 07:03:51,788 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-20 07:03:51,791 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-20 07:03:51,793 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-20 07:03:51,796 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-20 07:03:51,798 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-20 07:03:51,802 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-20 07:03:51,804 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-20 07:03:51,814 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-20 07:03:51,818 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-20 07:03:51,820 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-20 07:03:51,823 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-20 07:03:51,826 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-20 07:03:51,828 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-20 07:03:51,830 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-20 07:03:52,315 WARN L193 SmtUtils]: Spent 208.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 70 [2020-10-20 07:03:52,436 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-20 07:03:52,439 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-20 07:03:52,441 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-20 07:03:52,949 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:03:52,949 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 80 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 80 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:52,952 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-20 07:03:52,954 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:52,954 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:52,954 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:52,954 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:52,955 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:52,955 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:52,959 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 81 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 81 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:52,982 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-20 07:03:52,984 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:52,984 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:52,984 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:52,984 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:52,984 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:52,984 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:52,984 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:52,985 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:53,008 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 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,010 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,010 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:53,010 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,010 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,010 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,010 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:53,010 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:53,012 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 83 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 83 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,035 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-20 07:03:53,036 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,038 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:53,038 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:53,041 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 84 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 84 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,064 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-20 07:03:53,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:53,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,066 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:53,066 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:53,067 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 85 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 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,090 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-20 07:03:53,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,094 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:53,094 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:53,098 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:53,120 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 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,122 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,122 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:53,122 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,122 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,123 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,123 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:53,123 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:53,124 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 87 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 87 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,146 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-20 07:03:53,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:53,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,148 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:53,148 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:53,149 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 88 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 88 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,172 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-20 07:03:53,174 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,175 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:53,175 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:53,178 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 89 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 89 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,202 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-20 07:03:53,203 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,203 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:53,204 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,204 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,204 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,204 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:53,204 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:53,205 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 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:03:53,227 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-20 07:03:53,229 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,229 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:53,229 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,229 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,229 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,230 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:53,230 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:53,231 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 91 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 91 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,255 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-20 07:03:53,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:53,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,256 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,257 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:53,257 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:53,258 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 92 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 92 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,281 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-20 07:03:53,282 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:53,283 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,283 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,283 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,283 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:53,283 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:53,284 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 93 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 93 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,307 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-20 07:03:53,308 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,308 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:03:53,308 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,308 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,308 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,308 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:03:53,308 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:03:53,310 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 94 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 94 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,332 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-20 07:03:53,333 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,333 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,333 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,333 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,334 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:53,334 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:53,337 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 95 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 95 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,361 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-20 07:03:53,362 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,362 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,362 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,362 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,363 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:53,364 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:53,367 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 96 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 96 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,390 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-20 07:03:53,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:03:53,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:03:53,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:03:53,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:03:53,396 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:03:53,396 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:03:53,407 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:03:53,437 INFO L443 ModelExtractionUtils]: Simplification made 14 calls to the SMT solver. [2020-10-20 07:03:53,437 INFO L444 ModelExtractionUtils]: 5 out of 19 variables were initially zero. Simplification set additionally 12 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 97 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 97 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:03:53,443 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:03:53,447 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:03:53,447 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:03:53,447 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 07:03:53,590 INFO L297 tatePredicateManager]: 29 out of 29 supporting invariants were superfluous and have been removed [2020-10-20 07:03:53,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:53,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:53,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:03:53,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:53,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 5 conjunts are in the unsatisfiable core [2020-10-20 07:03:53,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:53,711 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-20 07:03:53,711 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-20 07:03:53,711 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 55 states and 70 transitions. cyclomatic complexity: 20 Second operand 5 states. [2020-10-20 07:03:53,787 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 55 states and 70 transitions. cyclomatic complexity: 20. Second operand 5 states. Result 150 states and 193 transitions. Complement of second has 9 states. [2020-10-20 07:03:53,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2020-10-20 07:03:53,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 07:03:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 31 transitions. [2020-10-20 07:03:53,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 29 letters. Loop has 5 letters. [2020-10-20 07:03:53,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:53,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 34 letters. Loop has 5 letters. [2020-10-20 07:03:53,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:53,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 31 transitions. Stem has 29 letters. Loop has 10 letters. [2020-10-20 07:03:53,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:03:53,790 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 193 transitions. [2020-10-20 07:03:53,792 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:03:53,793 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 119 states and 156 transitions. [2020-10-20 07:03:53,793 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 07:03:53,794 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 07:03:53,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 156 transitions. [2020-10-20 07:03:53,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:53,794 INFO L691 BuchiCegarLoop]: Abstraction has 119 states and 156 transitions. [2020-10-20 07:03:53,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 156 transitions. [2020-10-20 07:03:53,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 102. [2020-10-20 07:03:53,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-20 07:03:53,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2020-10-20 07:03:53,799 INFO L714 BuchiCegarLoop]: Abstraction has 102 states and 136 transitions. [2020-10-20 07:03:53,799 INFO L594 BuchiCegarLoop]: Abstraction has 102 states and 136 transitions. [2020-10-20 07:03:53,799 INFO L427 BuchiCegarLoop]: ======== Iteration 16============ [2020-10-20 07:03:53,799 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 136 transitions. [2020-10-20 07:03:53,800 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:03:53,800 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:53,801 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:53,803 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 07:03:53,803 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:03:53,804 INFO L794 eck$LassoCheckResult]: Stem: 3219#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3211#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 3212#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3224#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3225#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3194#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3195#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3229#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3228#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3227#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3226#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 3223#L17-4 main_~j~0 := 1; 3198#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3199#L22-5 main_#t~short13 := main_~i~0 >= 0; 3253#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3251#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3246#L23 assume !(main_~i~0 < 2); 3248#L23-2 main_~i~0 := main_~i~0 - 1; 3254#L22-5 main_#t~short13 := main_~i~0 >= 0; 3255#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3235#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3196#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3197#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3206#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3272#L22-5 main_#t~short13 := main_~i~0 >= 0; 3274#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3214#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3234#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3233#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3231#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3202#L22-5 main_#t~short13 := main_~i~0 >= 0; 3203#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3213#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3220#L23 assume !(main_~i~0 < 2); 3215#L23-2 [2020-10-20 07:03:53,804 INFO L796 eck$LassoCheckResult]: Loop: 3215#L23-2 main_~i~0 := main_~i~0 - 1; 3216#L22-5 main_#t~short13 := main_~i~0 >= 0; 3230#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3207#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3208#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 3215#L23-2 [2020-10-20 07:03:53,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:53,804 INFO L82 PathProgramCache]: Analyzing trace with hash -362290672, now seen corresponding path program 1 times [2020-10-20 07:03:53,805 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:53,805 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524218445] [2020-10-20 07:03:53,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:53,833 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-20 07:03:53,833 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524218445] [2020-10-20 07:03:53,833 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:03:53,833 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-20 07:03:53,834 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278418303] [2020-10-20 07:03:53,834 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:53,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:53,835 INFO L82 PathProgramCache]: Analyzing trace with hash 72930612, now seen corresponding path program 6 times [2020-10-20 07:03:53,835 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:53,835 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419956665] [2020-10-20 07:03:53,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:53,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:53,839 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:53,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:53,841 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:53,842 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:53,963 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:53,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-20 07:03:53,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-20 07:03:53,963 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. cyclomatic complexity: 44 Second operand 4 states. [2020-10-20 07:03:54,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:54,017 INFO L93 Difference]: Finished difference Result 80 states and 104 transitions. [2020-10-20 07:03:54,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:03:54,019 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 80 states and 104 transitions. [2020-10-20 07:03:54,020 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:03:54,021 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 80 states to 80 states and 104 transitions. [2020-10-20 07:03:54,021 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2020-10-20 07:03:54,021 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2020-10-20 07:03:54,021 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 104 transitions. [2020-10-20 07:03:54,021 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:54,021 INFO L691 BuchiCegarLoop]: Abstraction has 80 states and 104 transitions. [2020-10-20 07:03:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 104 transitions. [2020-10-20 07:03:54,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2020-10-20 07:03:54,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2020-10-20 07:03:54,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 104 transitions. [2020-10-20 07:03:54,026 INFO L714 BuchiCegarLoop]: Abstraction has 80 states and 104 transitions. [2020-10-20 07:03:54,027 INFO L594 BuchiCegarLoop]: Abstraction has 80 states and 104 transitions. [2020-10-20 07:03:54,027 INFO L427 BuchiCegarLoop]: ======== Iteration 17============ [2020-10-20 07:03:54,027 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 80 states and 104 transitions. [2020-10-20 07:03:54,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:03:54,029 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:54,029 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:54,033 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 07:03:54,034 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:03:54,034 INFO L794 eck$LassoCheckResult]: Stem: 3410#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3404#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 3405#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3414#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3415#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3385#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3386#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3421#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3418#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3417#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3416#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 3413#L17-4 main_~j~0 := 1; 3387#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3388#L22-5 main_#t~short13 := main_~i~0 >= 0; 3447#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3427#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3428#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3397#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3398#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3449#L22-5 main_#t~short13 := main_~i~0 >= 0; 3433#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3437#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3438#L23 assume !(main_~i~0 < 2); 3446#L23-2 main_~i~0 := main_~i~0 - 1; 3440#L22-5 main_#t~short13 := main_~i~0 >= 0; 3441#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3407#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3426#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3425#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3423#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3422#L22-5 main_#t~short13 := main_~i~0 >= 0; 3420#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3419#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3411#L23 assume !(main_~i~0 < 2); 3408#L23-2 [2020-10-20 07:03:54,035 INFO L796 eck$LassoCheckResult]: Loop: 3408#L23-2 main_~i~0 := main_~i~0 - 1; 3393#L22-5 main_#t~short13 := main_~i~0 >= 0; 3394#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3399#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3400#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 3408#L23-2 [2020-10-20 07:03:54,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:54,035 INFO L82 PathProgramCache]: Analyzing trace with hash -247927222, now seen corresponding path program 2 times [2020-10-20 07:03:54,036 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:54,036 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366287606] [2020-10-20 07:03:54,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:54,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:54,124 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-20 07:03:54,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366287606] [2020-10-20 07:03:54,125 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904601039] [2020-10-20 07:03:54,125 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 98 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:54,188 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 07:03:54,188 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:03:54,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:03:54,191 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:54,234 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 4 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2020-10-20 07:03:54,235 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:54,235 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2020-10-20 07:03:54,236 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159470286] [2020-10-20 07:03:54,236 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:54,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:54,237 INFO L82 PathProgramCache]: Analyzing trace with hash 72930612, now seen corresponding path program 7 times [2020-10-20 07:03:54,237 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:54,237 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603088249] [2020-10-20 07:03:54,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:54,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:54,242 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:54,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:54,244 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:54,246 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:54,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:54,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-20 07:03:54,361 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-20 07:03:54,361 INFO L87 Difference]: Start difference. First operand 80 states and 104 transitions. cyclomatic complexity: 32 Second operand 6 states. [2020-10-20 07:03:54,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:54,463 INFO L93 Difference]: Finished difference Result 99 states and 123 transitions. [2020-10-20 07:03:54,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2020-10-20 07:03:54,464 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 123 transitions. [2020-10-20 07:03:54,465 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 07:03:54,466 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 99 states and 123 transitions. [2020-10-20 07:03:54,466 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-20 07:03:54,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 07:03:54,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 123 transitions. [2020-10-20 07:03:54,466 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:54,466 INFO L691 BuchiCegarLoop]: Abstraction has 99 states and 123 transitions. [2020-10-20 07:03:54,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 123 transitions. [2020-10-20 07:03:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2020-10-20 07:03:54,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 07:03:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2020-10-20 07:03:54,473 INFO L714 BuchiCegarLoop]: Abstraction has 89 states and 112 transitions. [2020-10-20 07:03:54,474 INFO L594 BuchiCegarLoop]: Abstraction has 89 states and 112 transitions. [2020-10-20 07:03:54,474 INFO L427 BuchiCegarLoop]: ======== Iteration 18============ [2020-10-20 07:03:54,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 112 transitions. [2020-10-20 07:03:54,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 07:03:54,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:54,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:54,479 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2020-10-20 07:03:54,481 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:03:54,482 INFO L794 eck$LassoCheckResult]: Stem: 3699#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3693#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 3694#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3705#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3706#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3676#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3677#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3710#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3709#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3708#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3707#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 3704#L17-4 main_~j~0 := 1; 3678#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3679#L22-5 main_#t~short13 := main_~i~0 >= 0; 3736#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3735#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3734#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3733#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3680#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3681#L22-5 main_#t~short13 := main_~i~0 >= 0; 3725#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3722#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3682#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3683#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3688#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3732#L22-5 main_#t~short13 := main_~i~0 >= 0; 3726#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3727#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3764#L23 assume !(main_~i~0 < 2); 3763#L23-2 main_~i~0 := main_~i~0 - 1; 3744#L22-5 main_#t~short13 := main_~i~0 >= 0; 3695#L22-1 assume !main_#t~short13; 3696#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3721#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3720#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3718#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3716#L22-5 main_#t~short13 := main_~i~0 >= 0; 3714#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3712#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3700#L23 assume !(main_~i~0 < 2); 3701#L23-2 [2020-10-20 07:03:54,483 INFO L796 eck$LassoCheckResult]: Loop: 3701#L23-2 main_~i~0 := main_~i~0 - 1; 3717#L22-5 main_#t~short13 := main_~i~0 >= 0; 3715#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3713#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3711#L23 assume !(main_~i~0 < 2); 3701#L23-2 [2020-10-20 07:03:54,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:54,483 INFO L82 PathProgramCache]: Analyzing trace with hash 1974025145, now seen corresponding path program 1 times [2020-10-20 07:03:54,484 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:54,484 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846539406] [2020-10-20 07:03:54,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:54,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:54,543 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2020-10-20 07:03:54,543 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846539406] [2020-10-20 07:03:54,544 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-20 07:03:54,544 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-20 07:03:54,544 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [812679185] [2020-10-20 07:03:54,544 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:54,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:54,544 INFO L82 PathProgramCache]: Analyzing trace with hash 72930614, now seen corresponding path program 1 times [2020-10-20 07:03:54,545 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:54,545 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746164875] [2020-10-20 07:03:54,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:54,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:54,550 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:54,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:54,552 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:54,554 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:54,624 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:54,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-20 07:03:54,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-20 07:03:54,624 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. cyclomatic complexity: 32 Second operand 5 states. [2020-10-20 07:03:54,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:54,705 INFO L93 Difference]: Finished difference Result 99 states and 121 transitions. [2020-10-20 07:03:54,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-20 07:03:54,707 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 121 transitions. [2020-10-20 07:03:54,708 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 07:03:54,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 96 states and 117 transitions. [2020-10-20 07:03:54,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2020-10-20 07:03:54,710 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2020-10-20 07:03:54,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 96 states and 117 transitions. [2020-10-20 07:03:54,711 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:54,711 INFO L691 BuchiCegarLoop]: Abstraction has 96 states and 117 transitions. [2020-10-20 07:03:54,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states and 117 transitions. [2020-10-20 07:03:54,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2020-10-20 07:03:54,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2020-10-20 07:03:54,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 107 transitions. [2020-10-20 07:03:54,714 INFO L714 BuchiCegarLoop]: Abstraction has 87 states and 107 transitions. [2020-10-20 07:03:54,714 INFO L594 BuchiCegarLoop]: Abstraction has 87 states and 107 transitions. [2020-10-20 07:03:54,714 INFO L427 BuchiCegarLoop]: ======== Iteration 19============ [2020-10-20 07:03:54,714 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 107 transitions. [2020-10-20 07:03:54,715 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 07:03:54,715 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:54,715 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:54,716 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 07:03:54,716 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:03:54,716 INFO L794 eck$LassoCheckResult]: Stem: 3898#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 3892#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 3893#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3903#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3904#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3874#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3875#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3908#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3907#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 3906#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 3905#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 3902#L17-4 main_~j~0 := 1; 3878#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3879#L22-5 main_#t~short13 := main_~i~0 >= 0; 3935#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3921#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3922#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3882#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3883#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3931#L22-5 main_#t~short13 := main_~i~0 >= 0; 3932#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3926#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3876#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3877#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3880#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3881#L22-5 main_#t~short13 := main_~i~0 >= 0; 3923#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3924#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3900#L23 assume !(main_~i~0 < 2); 3901#L23-2 main_~i~0 := main_~i~0 - 1; 3960#L22-5 main_#t~short13 := main_~i~0 >= 0; 3959#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3958#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3920#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 3919#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 3917#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 3915#L22-5 main_#t~short13 := main_~i~0 >= 0; 3914#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3911#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3899#L23 assume !(main_~i~0 < 2); 3894#L23-2 [2020-10-20 07:03:54,717 INFO L796 eck$LassoCheckResult]: Loop: 3894#L23-2 main_~i~0 := main_~i~0 - 1; 3884#L22-5 main_#t~short13 := main_~i~0 >= 0; 3885#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 3888#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 3889#L23 assume !(main_~i~0 < 2); 3894#L23-2 [2020-10-20 07:03:54,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:54,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1293966775, now seen corresponding path program 3 times [2020-10-20 07:03:54,717 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:54,717 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527525655] [2020-10-20 07:03:54,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:54,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:03:55,286 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 24 proven. 32 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-10-20 07:03:55,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527525655] [2020-10-20 07:03:55,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [921480118] [2020-10-20 07:03:55,287 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 99 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:03:55,375 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2020-10-20 07:03:55,375 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:03:55,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 18 conjunts are in the unsatisfiable core [2020-10-20 07:03:55,377 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:03:55,391 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 10 treesize of output 9 [2020-10-20 07:03:55,392 INFO L545 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:55,420 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:55,427 INFO L384 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 11 [2020-10-20 07:03:55,428 INFO L545 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2020-10-20 07:03:55,456 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-10-20 07:03:55,456 INFO L545 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2020-10-20 07:03:55,456 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:48, output treesize:46 [2020-10-20 07:03:55,786 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2020-10-20 07:03:56,093 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 32 proven. 19 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2020-10-20 07:03:56,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:03:56,094 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2020-10-20 07:03:56,094 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1686284385] [2020-10-20 07:03:56,094 INFO L799 eck$LassoCheckResult]: stem already infeasible [2020-10-20 07:03:56,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:56,095 INFO L82 PathProgramCache]: Analyzing trace with hash 72930614, now seen corresponding path program 2 times [2020-10-20 07:03:56,095 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:56,095 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004095055] [2020-10-20 07:03:56,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:56,099 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:56,101 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:56,103 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:56,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:03:56,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2020-10-20 07:03:56,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=368, Unknown=0, NotChecked=0, Total=420 [2020-10-20 07:03:56,184 INFO L87 Difference]: Start difference. First operand 87 states and 107 transitions. cyclomatic complexity: 29 Second operand 21 states. [2020-10-20 07:03:57,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:03:57,903 INFO L93 Difference]: Finished difference Result 141 states and 172 transitions. [2020-10-20 07:03:57,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2020-10-20 07:03:57,905 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 172 transitions. [2020-10-20 07:03:57,906 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 07:03:57,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 90 states and 110 transitions. [2020-10-20 07:03:57,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2020-10-20 07:03:57,907 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 07:03:57,907 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 110 transitions. [2020-10-20 07:03:57,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:03:57,908 INFO L691 BuchiCegarLoop]: Abstraction has 90 states and 110 transitions. [2020-10-20 07:03:57,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 110 transitions. [2020-10-20 07:03:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2020-10-20 07:03:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2020-10-20 07:03:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 109 transitions. [2020-10-20 07:03:57,911 INFO L714 BuchiCegarLoop]: Abstraction has 89 states and 109 transitions. [2020-10-20 07:03:57,911 INFO L594 BuchiCegarLoop]: Abstraction has 89 states and 109 transitions. [2020-10-20 07:03:57,911 INFO L427 BuchiCegarLoop]: ======== Iteration 20============ [2020-10-20 07:03:57,911 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 89 states and 109 transitions. [2020-10-20 07:03:57,912 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 10 [2020-10-20 07:03:57,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:03:57,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:03:57,913 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1] [2020-10-20 07:03:57,913 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:03:57,913 INFO L794 eck$LassoCheckResult]: Stem: 4287#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 4281#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 4282#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 4292#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 4293#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 4263#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 4264#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 4299#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 4298#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 4297#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 4296#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 4295#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 4294#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 4291#L17-4 main_~j~0 := 1; 4265#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 4266#L22-5 main_#t~short13 := main_~i~0 >= 0; 4324#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4323#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4269#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 4270#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 4267#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 4268#L22-5 main_#t~short13 := main_~i~0 >= 0; 4317#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4313#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4314#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 4275#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 4276#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 4321#L22-5 main_#t~short13 := main_~i~0 >= 0; 4322#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4345#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4289#L23 assume !(main_~i~0 < 2); 4290#L23-2 main_~i~0 := main_~i~0 - 1; 4337#L22-5 main_#t~short13 := main_~i~0 >= 0; 4335#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4336#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4311#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 4310#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 4308#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 4306#L22-5 main_#t~short13 := main_~i~0 >= 0; 4304#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4302#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4288#L23 assume !(main_~i~0 < 2); 4285#L23-2 [2020-10-20 07:03:57,914 INFO L796 eck$LassoCheckResult]: Loop: 4285#L23-2 main_~i~0 := main_~i~0 - 1; 4271#L22-5 main_#t~short13 := main_~i~0 >= 0; 4272#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 4277#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 4278#L23 assume !(main_~i~0 < 2); 4285#L23-2 [2020-10-20 07:03:57,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:57,914 INFO L82 PathProgramCache]: Analyzing trace with hash 3606713, now seen corresponding path program 4 times [2020-10-20 07:03:57,914 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:57,915 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959103568] [2020-10-20 07:03:57,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:57,957 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:57,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:57,995 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:58,004 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:58,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:58,005 INFO L82 PathProgramCache]: Analyzing trace with hash 72930614, now seen corresponding path program 3 times [2020-10-20 07:03:58,005 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:58,005 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716054509] [2020-10-20 07:03:58,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:58,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:58,009 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:58,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:58,011 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:58,013 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:03:58,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:03:58,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1866628990, now seen corresponding path program 5 times [2020-10-20 07:03:58,014 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:03:58,014 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140983706] [2020-10-20 07:03:58,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:03:58,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:58,089 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:03:58,160 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:03:58,166 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:05,598 WARN L193 SmtUtils]: Spent 7.35 s on a formula simplification. DAG size of input: 409 DAG size of output: 251 [2020-10-20 07:04:06,867 WARN L193 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 157 DAG size of output: 123 [2020-10-20 07:04:06,876 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:04:06,876 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:04:06,876 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:04:06,876 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:04:06,876 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:04:06,876 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:06,876 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:04:06,877 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:04:06,877 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration20_Lasso [2020-10-20 07:04:06,877 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:04:06,877 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:04:06,879 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-20 07:04:06,889 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-20 07:04:06,892 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-20 07:04:06,896 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-20 07:04:06,899 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-20 07:04:06,902 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-20 07:04:06,906 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-20 07:04:06,910 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-20 07:04:06,914 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-20 07:04:07,355 WARN L193 SmtUtils]: Spent 112.00 ms on a formula simplification that was a NOOP. DAG size: 68 [2020-10-20 07:04:07,392 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-20 07:04:07,395 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-20 07:04:07,399 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-20 07:04:07,402 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-20 07:04:07,406 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-20 07:04:07,409 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-20 07:04:07,416 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-20 07:04:07,419 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-20 07:04:07,422 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-20 07:04:07,586 WARN L193 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2020-10-20 07:04:07,950 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:04:07,950 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 100 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 100 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:07,955 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-20 07:04:07,957 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:07,957 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:07,957 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:07,957 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:07,958 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:07,958 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:07,961 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 101 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 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:07,994 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-20 07:04:07,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:07,995 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:07,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:07,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:07,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:07,996 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:07,996 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:07,998 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 102 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 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,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-20 07:04:08,021 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,022 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:08,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,023 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:08,023 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:08,024 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 103 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 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,047 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-20 07:04:08,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,048 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:08,048 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,048 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:08,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:08,050 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 104 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 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,072 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-20 07:04:08,073 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,073 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:08,074 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,074 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,074 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,074 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:08,074 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:08,075 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 105 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 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,097 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-20 07:04:08,098 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,098 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,098 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,099 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:08,100 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:08,102 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:04:08,132 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 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,133 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,134 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,134 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,134 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,135 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:08,135 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:08,138 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 107 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 107 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,162 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-20 07:04:08,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,163 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:08,163 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,163 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,164 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:08,164 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:08,165 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 108 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 108 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,188 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-20 07:04:08,189 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,189 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:08,189 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,189 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,189 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,190 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:08,190 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:08,191 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 109 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 109 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,214 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-20 07:04:08,215 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,215 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,215 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,215 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,216 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:08,216 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:08,220 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 110 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 110 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,242 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-20 07:04:08,243 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,243 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:08,243 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,243 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,243 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,244 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:08,244 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:08,245 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 111 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 111 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,267 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-20 07:04:08,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,269 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:08,269 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:08,272 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 112 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 112 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,296 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-20 07:04:08,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,297 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:08,297 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,297 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,297 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,298 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:08,298 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:08,299 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 113 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 113 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,322 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-20 07:04:08,324 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,324 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:08,324 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,324 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,324 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,324 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:08,324 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:08,325 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 114 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 114 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,349 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-20 07:04:08,350 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:08,350 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:08,350 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:08,350 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:08,354 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:08,354 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:08,369 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:04:08,384 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2020-10-20 07:04:08,384 INFO L444 ModelExtractionUtils]: 7 out of 19 variables were initially zero. Simplification set additionally 10 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 115 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 115 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:08,386 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:04:08,388 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:04:08,388 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:04:08,388 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0) = 1*ULTIMATE.start_main_~i~0 Supporting invariants [] [2020-10-20 07:04:08,504 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2020-10-20 07:04:08,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:08,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:08,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:04:08,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:08,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:08,582 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:04:08,583 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:08,592 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-20 07:04:08,592 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-20 07:04:08,592 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-10-20 07:04:08,643 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 110 states and 135 transitions. Complement of second has 5 states. [2020-10-20 07:04:08,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 07:04:08,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:04:08,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-10-20 07:04:08,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 42 letters. Loop has 5 letters. [2020-10-20 07:04:08,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:08,647 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:04:08,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:08,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:04:08,698 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:08,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:08,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:04:08,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:08,722 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-20 07:04:08,722 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 07:04:08,723 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-10-20 07:04:08,756 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 110 states and 135 transitions. Complement of second has 5 states. [2020-10-20 07:04:08,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 07:04:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:04:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 28 transitions. [2020-10-20 07:04:08,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 28 transitions. Stem has 42 letters. Loop has 5 letters. [2020-10-20 07:04:08,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:08,760 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:04:08,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:08,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:08,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:04:08,820 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:08,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:08,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2020-10-20 07:04:08,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:08,837 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-20 07:04:08,837 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2020-10-20 07:04:08,838 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29 Second operand 3 states. [2020-10-20 07:04:08,875 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 89 states and 109 transitions. cyclomatic complexity: 29. Second operand 3 states. Result 128 states and 159 transitions. Complement of second has 4 states. [2020-10-20 07:04:08,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2020-10-20 07:04:08,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-10-20 07:04:08,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2020-10-20 07:04:08,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 42 letters. Loop has 5 letters. [2020-10-20 07:04:08,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:08,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 47 letters. Loop has 5 letters. [2020-10-20 07:04:08,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:08,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 42 letters. Loop has 10 letters. [2020-10-20 07:04:08,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:08,879 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 159 transitions. [2020-10-20 07:04:08,881 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:04:08,882 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 105 states and 127 transitions. [2020-10-20 07:04:08,882 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2020-10-20 07:04:08,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2020-10-20 07:04:08,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 105 states and 127 transitions. [2020-10-20 07:04:08,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:04:08,883 INFO L691 BuchiCegarLoop]: Abstraction has 105 states and 127 transitions. [2020-10-20 07:04:08,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states and 127 transitions. [2020-10-20 07:04:08,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 90. [2020-10-20 07:04:08,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2020-10-20 07:04:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 108 transitions. [2020-10-20 07:04:08,886 INFO L714 BuchiCegarLoop]: Abstraction has 90 states and 108 transitions. [2020-10-20 07:04:08,886 INFO L594 BuchiCegarLoop]: Abstraction has 90 states and 108 transitions. [2020-10-20 07:04:08,886 INFO L427 BuchiCegarLoop]: ======== Iteration 21============ [2020-10-20 07:04:08,886 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 108 transitions. [2020-10-20 07:04:08,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:04:08,887 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:08,887 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:08,888 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 5, 5, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1] [2020-10-20 07:04:08,888 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:08,889 INFO L794 eck$LassoCheckResult]: Stem: 5272#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5265#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 5266#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5278#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5279#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5247#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5248#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5285#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5284#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5283#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5282#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5281#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5280#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 5277#L17-4 main_~j~0 := 1; 5249#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5250#L22-5 main_#t~short13 := main_~i~0 >= 0; 5319#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5318#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5253#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5254#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5251#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5252#L22-5 main_#t~short13 := main_~i~0 >= 0; 5315#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5298#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5299#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5295#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5296#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5310#L22-5 main_#t~short13 := main_~i~0 >= 0; 5300#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5301#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5264#L23 assume !(main_~i~0 < 2); 5316#L23-2 main_~i~0 := main_~i~0 - 1; 5271#L22-5 main_#t~short13 := main_~i~0 >= 0; 5335#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5334#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5297#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5259#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5260#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5288#L22-5 main_#t~short13 := main_~i~0 >= 0; 5287#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5286#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5273#L23 assume !(main_~i~0 < 2); 5274#L23-2 main_~i~0 := main_~i~0 - 1; 5255#L22-5 [2020-10-20 07:04:08,889 INFO L796 eck$LassoCheckResult]: Loop: 5255#L22-5 main_#t~short13 := main_~i~0 >= 0; 5256#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5261#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5262#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 5269#L23-2 main_~i~0 := main_~i~0 - 1; 5255#L22-5 [2020-10-20 07:04:08,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:08,889 INFO L82 PathProgramCache]: Analyzing trace with hash 111808150, now seen corresponding path program 6 times [2020-10-20 07:04:08,889 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:08,890 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040742045] [2020-10-20 07:04:08,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:08,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:08,920 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:08,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:08,951 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:08,957 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:08,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:08,958 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 8 times [2020-10-20 07:04:08,958 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:08,958 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1858212153] [2020-10-20 07:04:08,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:08,961 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:08,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:08,964 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:08,965 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:08,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:08,966 INFO L82 PathProgramCache]: Analyzing trace with hash 2030923827, now seen corresponding path program 2 times [2020-10-20 07:04:08,966 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:08,966 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614433901] [2020-10-20 07:04:08,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 13 proven. 47 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-20 07:04:09,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614433901] [2020-10-20 07:04:09,103 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1992331540] [2020-10-20 07:04:09,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 116 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-10-20 07:04:09,185 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-10-20 07:04:09,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-10-20 07:04:09,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:04:09,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:09,214 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 29 proven. 31 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-10-20 07:04:09,214 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-10-20 07:04:09,215 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2020-10-20 07:04:09,215 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94955427] [2020-10-20 07:04:09,352 WARN L193 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-10-20 07:04:09,384 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-20 07:04:09,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-10-20 07:04:09,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-10-20 07:04:09,385 INFO L87 Difference]: Start difference. First operand 90 states and 108 transitions. cyclomatic complexity: 27 Second operand 9 states. [2020-10-20 07:04:09,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-20 07:04:09,588 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2020-10-20 07:04:09,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-10-20 07:04:09,589 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 152 states and 177 transitions. [2020-10-20 07:04:09,591 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:04:09,592 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 152 states to 145 states and 170 transitions. [2020-10-20 07:04:09,593 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2020-10-20 07:04:09,593 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2020-10-20 07:04:09,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 145 states and 170 transitions. [2020-10-20 07:04:09,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2020-10-20 07:04:09,593 INFO L691 BuchiCegarLoop]: Abstraction has 145 states and 170 transitions. [2020-10-20 07:04:09,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states and 170 transitions. [2020-10-20 07:04:09,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 102. [2020-10-20 07:04:09,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2020-10-20 07:04:09,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 122 transitions. [2020-10-20 07:04:09,597 INFO L714 BuchiCegarLoop]: Abstraction has 102 states and 122 transitions. [2020-10-20 07:04:09,597 INFO L594 BuchiCegarLoop]: Abstraction has 102 states and 122 transitions. [2020-10-20 07:04:09,597 INFO L427 BuchiCegarLoop]: ======== Iteration 22============ [2020-10-20 07:04:09,598 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 102 states and 122 transitions. [2020-10-20 07:04:09,598 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2020-10-20 07:04:09,598 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2020-10-20 07:04:09,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2020-10-20 07:04:09,599 INFO L852 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 5, 5, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1] [2020-10-20 07:04:09,599 INFO L853 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2020-10-20 07:04:09,600 INFO L794 eck$LassoCheckResult]: Stem: 5674#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string4.base, #t~string4.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string4.base, #t~string4.offset, 1);call write~init~int(0, #t~string4.base, 1 + #t~string4.offset, 1);call #t~string5.base, #t~string5.offset := #Ultimate.allocOnStack(19);call #t~string6.base, #t~string6.offset := #Ultimate.allocOnStack(12); 5666#L-1 havoc main_#res;havoc main_#t~nondet7, main_#t~nondet9, main_#t~post8, main_#t~mem11, main_#t~mem14, main_#t~mem12, main_#t~short13, main_#t~post10, main_#t~mem16, main_#t~mem17, main_#t~post15, main_~SIZE~0, main_~i~0, main_~j~0, main_~k~0, main_~key~0, main_~#v~0.base, main_~#v~0.offset;main_~SIZE~0 := main_#t~nondet7;havoc main_#t~nondet7;havoc main_~i~0;havoc main_~j~0;havoc main_~k~0;havoc main_~key~0;call main_~#v~0.base, main_~#v~0.offset := #Ultimate.allocOnStack(4 * (if main_~SIZE~0 % 4294967296 % 4294967296 <= 2147483647 then main_~SIZE~0 % 4294967296 % 4294967296 else main_~SIZE~0 % 4294967296 % 4294967296 - 4294967296));main_~j~0 := 0; 5667#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5679#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5680#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5650#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5651#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5686#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5685#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5684#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5683#L17-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call write~int(main_#t~nondet9, main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);havoc main_#t~nondet9; 5682#L17-2 main_#t~post8 := main_~j~0;main_~j~0 := 1 + main_#t~post8;havoc main_#t~post8; 5681#L17-3 assume !(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296); 5678#L17-4 main_~j~0 := 1; 5652#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5653#L22-5 main_#t~short13 := main_~i~0 >= 0; 5714#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5713#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5712#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5711#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5710#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5707#L22-5 main_#t~short13 := main_~i~0 >= 0; 5709#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5696#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5697#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5751#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5750#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5719#L22-5 main_#t~short13 := main_~i~0 >= 0; 5720#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5727#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5665#L23 assume !(main_~i~0 < 2); 5723#L23-2 main_~i~0 := main_~i~0 - 1; 5724#L22-5 main_#t~short13 := main_~i~0 >= 0; 5732#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5730#L22-3 assume !main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5695#L22-6 call write~int(main_~key~0, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4); 5694#L19-2 main_#t~post10 := main_~j~0;main_~j~0 := 1 + main_#t~post10;havoc main_#t~post10; 5687#L19-3 assume !!(main_~j~0 % 4294967296 < main_~SIZE~0 % 4294967296);call main_#t~mem11 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~j~0, 4);main_~key~0 := main_#t~mem11;havoc main_#t~mem11;main_~i~0 := main_~j~0 - 1; 5658#L22-5 main_#t~short13 := main_~i~0 >= 0; 5659#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5662#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5663#L23 assume !(main_~i~0 < 2); 5671#L23-2 main_~i~0 := main_~i~0 - 1; 5672#L22-5 main_#t~short13 := main_~i~0 >= 0; 5693#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5692#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5691#L23 assume !(main_~i~0 < 2); 5689#L23-2 main_~i~0 := main_~i~0 - 1; 5690#L22-5 [2020-10-20 07:04:09,600 INFO L796 eck$LassoCheckResult]: Loop: 5690#L22-5 main_#t~short13 := main_~i~0 >= 0; 5668#L22-1 assume main_#t~short13;call main_#t~mem12 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);main_#t~short13 := main_#t~mem12 > main_~key~0; 5669#L22-3 assume !!main_#t~short13;havoc main_#t~mem12;havoc main_#t~short13; 5675#L23 assume main_~i~0 < 2;call main_#t~mem14 := read~int(main_~#v~0.base, main_~#v~0.offset + 4 * main_~i~0, 4);call write~int(main_#t~mem14, main_~#v~0.base, main_~#v~0.offset + 4 * (1 + main_~i~0), 4);havoc main_#t~mem14; 5676#L23-2 main_~i~0 := main_~i~0 - 1; 5690#L22-5 [2020-10-20 07:04:09,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:09,600 INFO L82 PathProgramCache]: Analyzing trace with hash 2030923889, now seen corresponding path program 7 times [2020-10-20 07:04:09,601 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:09,601 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616395627] [2020-10-20 07:04:09,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:09,630 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:09,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:09,659 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:09,665 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:09,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:09,666 INFO L82 PathProgramCache]: Analyzing trace with hash 56404392, now seen corresponding path program 9 times [2020-10-20 07:04:09,666 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:09,666 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324181215] [2020-10-20 07:04:09,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:09,669 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:09,672 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:09,673 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:09,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:09,673 INFO L82 PathProgramCache]: Analyzing trace with hash 139722552, now seen corresponding path program 3 times [2020-10-20 07:04:09,674 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-20 07:04:09,674 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636177279] [2020-10-20 07:04:09,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-20 07:04:09,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:09,712 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:09,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-20 07:04:09,751 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-20 07:04:09,757 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-20 07:04:09,864 WARN L193 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 41 [2020-10-20 07:04:18,962 WARN L193 SmtUtils]: Spent 9.06 s on a formula simplification. DAG size of input: 441 DAG size of output: 273 [2020-10-20 07:04:21,250 WARN L193 SmtUtils]: Spent 2.22 s on a formula simplification. DAG size of input: 214 DAG size of output: 152 [2020-10-20 07:04:21,255 INFO L210 LassoAnalysis]: Preferences: [2020-10-20 07:04:21,255 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2020-10-20 07:04:21,255 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2020-10-20 07:04:21,255 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2020-10-20 07:04:21,255 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2020-10-20 07:04:21,255 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:21,255 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2020-10-20 07:04:21,255 INFO L132 ssoRankerPreferences]: Path of dumped script: [2020-10-20 07:04:21,255 INFO L133 ssoRankerPreferences]: Filename of dumped script: insertion_sort-1.c_Iteration22_Lasso [2020-10-20 07:04:21,255 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2020-10-20 07:04:21,256 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2020-10-20 07:04:21,256 WARN L313 ript$VariableManager]: TermVariabe aux_div_v_ULTIMATE.start_main_~j~0_237_47 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 07:04:21,256 WARN L313 ript$VariableManager]: TermVariabe aux_mod_v_ULTIMATE.start_main_~j~0_237_47 not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-20 07:04:21,259 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-20 07:04:21,276 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-20 07:04:21,279 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-20 07:04:21,282 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-20 07:04:21,286 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-20 07:04:21,291 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-20 07:04:21,296 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-20 07:04:21,299 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-20 07:04:21,304 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-20 07:04:21,308 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-20 07:04:21,313 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-20 07:04:21,316 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-20 07:04:21,319 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-20 07:04:21,323 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-20 07:04:21,327 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-20 07:04:21,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-20 07:04:21,335 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-20 07:04:21,339 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-20 07:04:22,656 WARN L193 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 82 [2020-10-20 07:04:23,311 INFO L292 LassoAnalysis]: Preprocessing complete. [2020-10-20 07:04:23,312 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 117 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 117 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,315 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-20 07:04:23,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,316 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,316 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,316 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,316 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,317 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,318 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 118 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 118 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,340 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-20 07:04:23,341 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,341 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,341 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,341 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,341 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,342 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,342 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,348 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 119 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 119 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,371 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-20 07:04:23,372 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,372 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,373 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,373 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,373 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,374 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 120 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 120 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,398 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-20 07:04:23,399 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,399 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,399 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,399 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,400 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,400 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,400 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,401 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 121 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 121 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,423 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-20 07:04:23,424 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,424 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,425 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,425 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,425 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:23,426 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:23,429 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 122 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 122 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,452 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-20 07:04:23,453 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,453 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,453 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,453 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,456 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:23,456 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:23,460 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 123 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 123 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,484 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-20 07:04:23,486 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,486 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,486 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,486 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,486 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,486 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,488 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 124 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 124 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,511 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-20 07:04:23,512 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,512 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,513 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,513 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,513 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,514 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 125 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 125 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,536 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-20 07:04:23,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,538 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:23,539 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:23,542 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 126 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 126 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,566 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-20 07:04:23,567 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,567 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,567 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,568 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,568 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,568 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,568 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,569 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 127 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 127 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,591 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-20 07:04:23,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,593 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,594 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 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:04:23,617 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 128 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,618 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,618 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,619 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,619 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,619 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,619 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,619 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,620 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 129 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 129 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,643 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-20 07:04:23,644 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,644 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,645 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,645 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,645 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,645 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,645 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,646 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 130 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 130 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,677 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-20 07:04:23,679 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,679 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,679 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,679 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,679 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,680 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,680 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,682 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 131 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 131 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,706 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-20 07:04:23,708 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,708 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,708 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,708 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,709 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,709 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,709 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,710 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 132 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 132 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,733 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-20 07:04:23,734 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,734 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,734 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,734 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,734 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,735 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,735 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,736 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 133 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 133 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,759 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-20 07:04:23,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,761 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,761 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,761 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,762 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:23,762 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:23,766 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 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2020-10-20 07:04:23,790 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 134 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,792 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,792 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,792 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:23,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:23,797 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 135 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 135 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,820 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-20 07:04:23,822 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,822 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,822 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,822 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,822 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,822 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,823 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,824 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 136 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 136 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,846 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-20 07:04:23,848 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,848 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,848 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,849 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,849 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:23,850 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:23,852 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 137 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 137 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,875 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-20 07:04:23,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,877 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,877 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,877 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:23,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:23,885 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 138 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 138 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,907 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-20 07:04:23,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,910 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:23,910 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:23,914 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 139 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 139 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,937 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-20 07:04:23,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,940 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:23,940 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:23,943 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 140 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 140 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,965 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-20 07:04:23,967 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,967 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,967 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,967 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,967 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,969 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 141 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 141 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:23,992 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-20 07:04:23,993 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:23,993 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2020-10-20 07:04:23,993 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:23,993 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:23,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:23,994 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2020-10-20 07:04:23,994 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2020-10-20 07:04:23,996 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 142 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 142 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:24,018 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-20 07:04:24,020 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2020-10-20 07:04:24,020 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2020-10-20 07:04:24,020 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2020-10-20 07:04:24,020 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2020-10-20 07:04:24,024 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2020-10-20 07:04:24,024 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2020-10-20 07:04:24,037 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2020-10-20 07:04:24,054 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2020-10-20 07:04:24,054 INFO L444 ModelExtractionUtils]: 9 out of 19 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 143 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 143 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2020-10-20 07:04:24,056 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2020-10-20 07:04:24,058 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2020-10-20 07:04:24,058 INFO L510 LassoAnalysis]: Proved termination. [2020-10-20 07:04:24,058 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i~0, v_rep(select #length ULTIMATE.start_main_~#v~0.base)_8) = 16*ULTIMATE.start_main_~i~0 + 1*v_rep(select #length ULTIMATE.start_main_~#v~0.base)_8 Supporting invariants [] [2020-10-20 07:04:24,203 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2020-10-20 07:04:24,205 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-10-20 07:04:24,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:24,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:24,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:04:24,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:24,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:04:24,279 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:24,348 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-20 07:04:24,349 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-20 07:04:24,349 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29 Second operand 5 states. [2020-10-20 07:04:24,453 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29. Second operand 5 states. Result 225 states and 260 transitions. Complement of second has 11 states. [2020-10-20 07:04:24,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 07:04:24,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 07:04:24,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-10-20 07:04:24,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 48 letters. Loop has 5 letters. [2020-10-20 07:04:24,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:24,458 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:04:24,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:24,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:24,521 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:04:24,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:24,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:24,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:04:24,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:24,621 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-20 07:04:24,622 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-20 07:04:24,622 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29 Second operand 5 states. [2020-10-20 07:04:24,727 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29. Second operand 5 states. Result 225 states and 260 transitions. Complement of second has 11 states. [2020-10-20 07:04:24,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 07:04:24,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 07:04:24,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-10-20 07:04:24,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 48 letters. Loop has 5 letters. [2020-10-20 07:04:24,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:24,729 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2020-10-20 07:04:24,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-20 07:04:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:24,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 2 conjunts are in the unsatisfiable core [2020-10-20 07:04:24,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-20 07:04:24,801 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 7 conjunts are in the unsatisfiable core [2020-10-20 07:04:24,802 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-10-20 07:04:24,870 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-20 07:04:24,870 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2020-10-20 07:04:24,871 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29 Second operand 5 states. [2020-10-20 07:04:24,973 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 102 states and 122 transitions. cyclomatic complexity: 29. Second operand 5 states. Result 209 states and 241 transitions. Complement of second has 12 states. [2020-10-20 07:04:24,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2020-10-20 07:04:24,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-10-20 07:04:24,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 33 transitions. [2020-10-20 07:04:24,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 48 letters. Loop has 5 letters. [2020-10-20 07:04:24,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:24,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 53 letters. Loop has 5 letters. [2020-10-20 07:04:24,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:24,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 33 transitions. Stem has 48 letters. Loop has 10 letters. [2020-10-20 07:04:24,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2020-10-20 07:04:24,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 209 states and 241 transitions. [2020-10-20 07:04:24,979 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:04:24,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 209 states to 0 states and 0 transitions. [2020-10-20 07:04:24,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2020-10-20 07:04:24,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2020-10-20 07:04:24,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2020-10-20 07:04:24,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2020-10-20 07:04:24,980 INFO L691 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:04:24,980 INFO L714 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:04:24,980 INFO L594 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-10-20 07:04:24,980 INFO L427 BuchiCegarLoop]: ======== Iteration 23============ [2020-10-20 07:04:24,980 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2020-10-20 07:04:24,980 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2020-10-20 07:04:24,980 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2020-10-20 07:04:24,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 20.10 07:04:24 BoogieIcfgContainer [2020-10-20 07:04:24,987 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2020-10-20 07:04:24,987 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-10-20 07:04:24,987 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-10-20 07:04:24,987 INFO L275 PluginConnector]: Witness Printer initialized [2020-10-20 07:04:24,988 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.10 07:03:17" (3/4) ... [2020-10-20 07:04:24,991 INFO L140 WitnessPrinter]: No result that supports witness generation found [2020-10-20 07:04:24,991 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-10-20 07:04:24,992 INFO L168 Benchmark]: Toolchain (without parser) took 68218.52 ms. Allocated memory was 35.7 MB in the beginning and 198.2 MB in the end (delta: 162.5 MB). Free memory was 8.6 MB in the beginning and 109.0 MB in the end (delta: -100.3 MB). Peak memory consumption was 62.2 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,993 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 34.6 MB. Free memory was 13.1 MB in the beginning and 13.1 MB in the end (delta: 3.1 kB). Peak memory consumption was 3.1 kB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,993 INFO L168 Benchmark]: CACSL2BoogieTranslator took 332.09 ms. Allocated memory was 35.7 MB in the beginning and 44.6 MB in the end (delta: 8.9 MB). Free memory was 7.8 MB in the beginning and 26.7 MB in the end (delta: -18.9 MB). Peak memory consumption was 6.2 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,994 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.32 ms. Allocated memory is still 44.6 MB. Free memory was 26.7 MB in the beginning and 24.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,994 INFO L168 Benchmark]: Boogie Preprocessor took 32.78 ms. Allocated memory is still 44.6 MB. Free memory was 24.8 MB in the beginning and 23.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,995 INFO L168 Benchmark]: RCFGBuilder took 375.32 ms. Allocated memory was 44.6 MB in the beginning and 46.7 MB in the end (delta: 2.1 MB). Free memory was 23.2 MB in the beginning and 19.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 11.8 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,995 INFO L168 Benchmark]: BuchiAutomizer took 67422.12 ms. Allocated memory was 46.7 MB in the beginning and 198.2 MB in the end (delta: 151.5 MB). Free memory was 19.4 MB in the beginning and 109.0 MB in the end (delta: -89.5 MB). Peak memory consumption was 62.0 MB. Max. memory is 14.3 GB. [2020-10-20 07:04:24,995 INFO L168 Benchmark]: Witness Printer took 4.11 ms. Allocated memory is still 198.2 MB. Free memory is still 109.0 MB. There was no memory consumed. Max. memory is 14.3 GB. [2020-10-20 07:04:24,998 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20 ms. Allocated memory is still 34.6 MB. Free memory was 13.1 MB in the beginning and 13.1 MB in the end (delta: 3.1 kB). Peak memory consumption was 3.1 kB. Max. memory is 14.3 GB. * CACSL2BoogieTranslator took 332.09 ms. Allocated memory was 35.7 MB in the beginning and 44.6 MB in the end (delta: 8.9 MB). Free memory was 7.8 MB in the beginning and 26.7 MB in the end (delta: -18.9 MB). Peak memory consumption was 6.2 MB. Max. memory is 14.3 GB. * Boogie Procedure Inliner took 42.32 ms. Allocated memory is still 44.6 MB. Free memory was 26.7 MB in the beginning and 24.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 14.3 GB. * Boogie Preprocessor took 32.78 ms. Allocated memory is still 44.6 MB. Free memory was 24.8 MB in the beginning and 23.3 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 14.3 GB. * RCFGBuilder took 375.32 ms. Allocated memory was 44.6 MB in the beginning and 46.7 MB in the end (delta: 2.1 MB). Free memory was 23.2 MB in the beginning and 19.7 MB in the end (delta: 3.5 MB). Peak memory consumption was 11.8 MB. Max. memory is 14.3 GB. * BuchiAutomizer took 67422.12 ms. Allocated memory was 46.7 MB in the beginning and 198.2 MB in the end (delta: 151.5 MB). Free memory was 19.4 MB in the beginning and 109.0 MB in the end (delta: -89.5 MB). Peak memory consumption was 62.0 MB. Max. memory is 14.3 GB. * Witness Printer took 4.11 ms. Allocated memory is still 198.2 MB. Free memory is still 109.0 MB. There was no memory consumed. Max. memory is 14.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 22 terminating modules (14 trivial, 5 deterministic, 3 nondeterministic). One deterministic module has affine ranking function unknown-#length-unknown[v] + -4 * j + -1 * v and consists of 5 locations. One deterministic module has affine ranking function unknown-#length-unknown[v] + -2 * j and consists of 7 locations. One deterministic module has affine ranking function 2 * i + j and consists of 6 locations. One deterministic module has affine ranking function -1 * v + unknown-#length-unknown[v] + -4 * k and consists of 3 locations. One deterministic module has affine ranking function i and consists of 5 locations. One nondeterministic module has affine ranking function 4 * i + j and consists of 8 locations. One nondeterministic module has affine ranking function i and consists of 3 locations. One nondeterministic module has affine ranking function 16 * i + unknown-#length-unknown[v] and consists of 6 locations. 14 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 67.3s and 23 iterations. TraceHistogramMax:6. Analysis of lassos took 53.8s. Construction of modules took 6.8s. Büchi inclusion checks took 6.2s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 17. Automata minimization 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 210 StatesRemovedByMinimization, 17 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 102 states and ocurred in iteration 15. Nontrivial modules had stage [5, 0, 3, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 483 SDtfs, 1122 SDslu, 884 SDs, 0 SdLazy, 1693 SolverSat, 241 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 6.8s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc6 concLT0 SILN0 SILU7 SILI0 SILT0 lasso8 LassoPreprocessingBenchmarks: Lassos: inital511 mio100 ax100 hnf99 lsp99 ukn42 mio100 lsp53 div185 bol100 ite100 ukn100 eq149 hnf62 smp87 dnf114 smp94 tf100 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 89ms VariablesStem: 7 VariablesLoop: 9 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...