./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 30f4e4ab Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i -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 771ea31dfbd697ea24d6820053320d940f30ec07 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-30f4e4a [2019-11-28 03:54:13,497 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:54:13,499 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:54:13,517 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:54:13,518 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:54:13,520 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:54:13,522 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:54:13,531 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:54:13,536 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:54:13,540 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:54:13,541 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:54:13,544 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:54:13,544 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:54:13,548 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:54:13,549 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:54:13,550 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:54:13,552 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:54:13,553 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:54:13,556 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:54:13,560 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:54:13,564 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:54:13,568 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:54:13,570 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:54:13,571 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:54:13,575 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:54:13,576 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:54:13,576 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:54:13,578 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:54:13,579 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:54:13,580 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:54:13,580 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:54:13,581 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:54:13,582 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:54:13,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:54:13,585 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:54:13,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:54:13,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:54:13,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:54:13,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:54:13,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:54:13,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:54:13,589 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-28 03:54:13,605 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:54:13,605 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:54:13,606 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:54:13,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:54:13,607 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:54:13,607 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:54:13,607 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:54:13,608 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:54:13,608 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:54:13,608 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:54:13,608 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:54:13,608 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:54:13,609 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 03:54:13,609 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:54:13,609 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:54:13,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 03:54:13,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:54:13,610 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:54:13,610 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:54:13,610 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:54:13,610 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 03:54:13,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:54:13,611 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:54:13,611 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:54:13,611 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:54:13,611 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:54:13,612 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:54:13,612 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:54:13,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:54:13,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:54:13,612 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:54:13,613 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:54:13,614 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 -> 771ea31dfbd697ea24d6820053320d940f30ec07 [2019-11-28 03:54:13,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:54:13,936 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:54:13,939 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:54:13,940 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:54:13,940 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:54:13,941 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-11-28 03:54:14,008 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2d8ed3b/9708a357e3af43dfa3ed02959501e084/FLAG210d5d11c [2019-11-28 03:54:14,610 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:54:14,611 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-memsafety/memleaks_test17_2-2.i [2019-11-28 03:54:14,630 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2d8ed3b/9708a357e3af43dfa3ed02959501e084/FLAG210d5d11c [2019-11-28 03:54:14,873 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f2d8ed3b/9708a357e3af43dfa3ed02959501e084 [2019-11-28 03:54:14,876 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:54:14,877 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:54:14,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:14,880 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:54:14,884 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:54:14,885 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:14" (1/1) ... [2019-11-28 03:54:14,888 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7903573a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:14, skipping insertion in model container [2019-11-28 03:54:14,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:54:14" (1/1) ... [2019-11-28 03:54:14,897 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:54:14,954 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:54:15,476 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:15,506 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:54:15,578 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:54:15,676 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:54:15,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15 WrapperNode [2019-11-28 03:54:15,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:54:15,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:15,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:54:15,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:54:15,688 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:54:15,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:54:15,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:54:15,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:54:15,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,774 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,774 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,782 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,789 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (1/1) ... [2019-11-28 03:54:15,792 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:54:15,793 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:54:15,793 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:54:15,793 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:54:15,794 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (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 [2019-11-28 03:54:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:54:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-28 03:54:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-28 03:54:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-28 03:54:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:54:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-11-28 03:54:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:54:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:54:16,257 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:54:16,257 INFO L297 CfgBuilder]: Removed 20 assume(true) statements. [2019-11-28 03:54:16,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:16 BoogieIcfgContainer [2019-11-28 03:54:16,259 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:54:16,260 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:54:16,260 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:54:16,264 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:54:16,265 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:16,266 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:54:14" (1/3) ... [2019-11-28 03:54:16,267 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@615f50db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:16, skipping insertion in model container [2019-11-28 03:54:16,267 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:16,267 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:54:15" (2/3) ... [2019-11-28 03:54:16,268 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@615f50db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:54:16, skipping insertion in model container [2019-11-28 03:54:16,268 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:54:16,268 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:16" (3/3) ... [2019-11-28 03:54:16,270 INFO L371 chiAutomizerObserver]: Analyzing ICFG memleaks_test17_2-2.i [2019-11-28 03:54:16,313 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:54:16,313 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:54:16,313 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:54:16,314 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:54:16,314 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:54:16,314 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:54:16,314 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:54:16,314 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:54:16,327 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-28 03:54:16,348 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:54:16,349 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:16,349 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:16,355 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:16,355 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:16,355 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:54:16,355 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states. [2019-11-28 03:54:16,358 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:54:16,358 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:16,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:16,359 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:16,359 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:16,365 INFO L794 eck$LassoCheckResult]: Stem: 22#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 9#L-1true havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 23#L520true assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 11#L521true entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 3#L526true assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 25#L529true entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 5#L789true assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 12#L790-3true [2019-11-28 03:54:16,365 INFO L796 eck$LassoCheckResult]: Loop: 12#L790-3true assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 10#L790-2true entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 12#L790-3true [2019-11-28 03:54:16,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:16,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1806815372, now seen corresponding path program 1 times [2019-11-28 03:54:16,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:16,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476707199] [2019-11-28 03:54:16,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:16,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:16,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476707199] [2019-11-28 03:54:16,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:16,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 03:54:16,628 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169769634] [2019-11-28 03:54:16,638 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:16,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:16,640 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 1 times [2019-11-28 03:54:16,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:16,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953183287] [2019-11-28 03:54:16,642 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:16,735 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:16,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:16,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:54:16,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:54:16,857 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 4 states. [2019-11-28 03:54:16,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:16,963 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2019-11-28 03:54:16,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:16,966 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 56 transitions. [2019-11-28 03:54:16,969 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 19 [2019-11-28 03:54:16,975 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 35 states and 44 transitions. [2019-11-28 03:54:16,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-28 03:54:16,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2019-11-28 03:54:16,978 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 44 transitions. [2019-11-28 03:54:16,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:16,979 INFO L688 BuchiCegarLoop]: Abstraction has 35 states and 44 transitions. [2019-11-28 03:54:16,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 44 transitions. [2019-11-28 03:54:17,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 23. [2019-11-28 03:54:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:54:17,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions. [2019-11-28 03:54:17,016 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 03:54:17,017 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 29 transitions. [2019-11-28 03:54:17,017 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:54:17,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 29 transitions. [2019-11-28 03:54:17,020 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:54:17,021 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:17,021 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:17,022 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:17,022 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:17,022 INFO L794 eck$LassoCheckResult]: Stem: 105#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 101#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 102#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 104#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 87#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 88#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 94#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 95#L790-3 [2019-11-28 03:54:17,023 INFO L796 eck$LassoCheckResult]: Loop: 95#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 103#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 95#L790-3 [2019-11-28 03:54:17,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:17,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1806813450, now seen corresponding path program 1 times [2019-11-28 03:54:17,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:17,024 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373700388] [2019-11-28 03:54:17,024 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:17,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:17,088 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:17,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:17,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1827, now seen corresponding path program 2 times [2019-11-28 03:54:17,091 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:17,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809264231] [2019-11-28 03:54:17,092 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:17,112 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:17,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938732, now seen corresponding path program 1 times [2019-11-28 03:54:17,113 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:17,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687253406] [2019-11-28 03:54:17,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:17,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:17,166 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:17,546 WARN L192 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-28 03:54:17,712 WARN L192 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 71 [2019-11-28 03:54:17,729 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:54:17,730 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:54:17,730 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:54:17,730 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:54:17,730 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:54:17,731 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:17,731 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:54:17,731 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:54:17,732 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration2_Lasso [2019-11-28 03:54:17,732 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:54:17,733 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:54:17,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:17,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:18,095 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 58 [2019-11-28 03:54:18,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:18,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:18,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:18,766 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-28 03:54:18,805 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:54:18,811 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) [2019-11-28 03:54:18,827 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 [2019-11-28 03:54:18,830 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:18,830 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:18,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:18,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:18,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:18,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:18,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:18,838 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) [2019-11-28 03:54:18,855 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:18,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:18,858 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:18,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:18,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:18,865 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:18,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:18,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:18,909 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 [2019-11-28 03:54:18,913 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:18,913 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:18,913 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:18,913 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:18,960 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:18,961 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:18,978 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) [2019-11-28 03:54:18,993 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 [2019-11-28 03:54:18,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:18,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:18,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:18,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:18,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:18,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:18,998 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:19,000 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 [2019-11-28 03:54:19,014 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 [2019-11-28 03:54:19,016 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,016 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,016 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,017 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,025 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,025 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:19,031 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 [2019-11-28 03:54:19,042 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 [2019-11-28 03:54:19,045 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,045 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:19,046 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,046 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,046 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,048 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:19,048 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:19,053 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 [2019-11-28 03:54:19,068 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 [2019-11-28 03:54:19,070 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,070 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,070 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,071 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,076 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,076 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:19,084 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) [2019-11-28 03:54:19,103 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 [2019-11-28 03:54:19,107 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,107 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,107 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,108 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,113 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,113 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:19,119 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:19,134 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 [2019-11-28 03:54:19,135 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,136 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:19,136 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,136 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,136 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,141 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:19,141 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:19,145 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) [2019-11-28 03:54:19,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 [2019-11-28 03:54:19,163 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,164 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,164 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,164 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,168 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,168 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:19,172 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) [2019-11-28 03:54:19,181 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:19,184 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,184 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,184 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,184 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,189 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,189 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:19,194 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 [2019-11-28 03:54:19,205 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 [2019-11-28 03:54:19,208 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,209 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,209 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,209 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,213 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,214 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:19,218 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) [2019-11-28 03:54:19,229 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:19,231 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,231 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,232 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,232 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,234 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,234 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:19,240 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) [2019-11-28 03:54:19,247 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:19,250 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,250 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:19,250 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,250 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,250 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,251 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:19,251 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:19,253 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) [2019-11-28 03:54:19,271 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 [2019-11-28 03:54:19,275 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,275 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:19,275 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,275 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,276 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,276 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:19,276 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:19,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 Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 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 [2019-11-28 03:54:19,294 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:54:19,297 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,298 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,298 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,298 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,301 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,301 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:19,305 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 [2019-11-28 03:54:19,314 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 [2019-11-28 03:54:19,316 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,316 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,317 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,317 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,321 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,321 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:19,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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:19,344 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 [2019-11-28 03:54:19,346 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,346 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,346 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,346 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,348 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,349 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:19,353 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 [2019-11-28 03:54:19,368 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 [2019-11-28 03:54:19,369 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,370 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,370 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,370 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,373 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,373 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:19,380 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 [2019-11-28 03:54:19,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 [2019-11-28 03:54:19,392 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:19,392 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:19,392 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:19,392 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:19,401 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:19,404 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:19,421 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:54:19,500 INFO L443 ModelExtractionUtils]: Simplification made 20 calls to the SMT solver. [2019-11-28 03:54:19,500 INFO L444 ModelExtractionUtils]: 5 out of 34 variables were initially zero. Simplification set additionally 25 variables to zero. 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) [2019-11-28 03:54:19,516 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:19,520 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:54:19,521 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:54:19,522 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_entry_point_~array~0.offset, ULTIMATE.start_entry_point_~i~2, v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1) = -1*ULTIMATE.start_entry_point_~array~0.offset - 4*ULTIMATE.start_entry_point_~i~2 + 1*v_rep(select #length ULTIMATE.start_ldv_malloc_#t~malloc12.base)_1 Supporting invariants [] [2019-11-28 03:54:19,559 INFO L297 tatePredicateManager]: 6 out of 7 supporting invariants were superfluous and have been removed [2019-11-28 03:54:19,574 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-11-28 03:54:19,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:19,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:19,640 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:54:19,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:19,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:19,690 INFO L255 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:54:19,690 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:19,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:19,723 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2019-11-28 03:54:19,723 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10 Second operand 5 states. [2019-11-28 03:54:19,846 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 23 states and 29 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 36 states and 47 transitions. Complement of second has 9 states. [2019-11-28 03:54:19,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:54:19,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:54:19,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 17 transitions. [2019-11-28 03:54:19,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 7 letters. Loop has 2 letters. [2019-11-28 03:54:19,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:19,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-28 03:54:19,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:19,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 17 transitions. Stem has 7 letters. Loop has 4 letters. [2019-11-28 03:54:19,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:19,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-11-28 03:54:19,863 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 11 [2019-11-28 03:54:19,864 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 29 states and 37 transitions. [2019-11-28 03:54:19,865 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2019-11-28 03:54:19,865 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 03:54:19,865 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 37 transitions. [2019-11-28 03:54:19,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:19,866 INFO L688 BuchiCegarLoop]: Abstraction has 29 states and 37 transitions. [2019-11-28 03:54:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 37 transitions. [2019-11-28 03:54:19,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2019-11-28 03:54:19,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 03:54:19,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2019-11-28 03:54:19,871 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-28 03:54:19,871 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 31 transitions. [2019-11-28 03:54:19,871 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:54:19,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 31 transitions. [2019-11-28 03:54:19,874 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 03:54:19,874 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:19,875 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:19,875 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:19,875 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:54:19,876 INFO L794 eck$LassoCheckResult]: Stem: 256#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 252#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 253#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 254#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 236#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 237#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 243#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 244#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 255#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 257#L765-3 [2019-11-28 03:54:19,876 INFO L796 eck$LassoCheckResult]: Loop: 257#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 238#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 239#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 247#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 249#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 257#L765-3 [2019-11-28 03:54:19,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:19,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1180938674, now seen corresponding path program 1 times [2019-11-28 03:54:19,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:19,877 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086145997] [2019-11-28 03:54:19,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:19,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:19,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:19,995 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086145997] [2019-11-28 03:54:19,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:19,996 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:19,996 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195734592] [2019-11-28 03:54:19,996 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:19,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:19,997 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 1 times [2019-11-28 03:54:19,997 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:19,997 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456093571] [2019-11-28 03:54:19,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:20,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:20,042 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:20,229 WARN L192 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-28 03:54:20,318 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:20,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:20,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:20,319 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 03:54:20,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:20,389 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2019-11-28 03:54:20,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:20,390 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 58 transitions. [2019-11-28 03:54:20,394 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2019-11-28 03:54:20,395 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 46 states and 58 transitions. [2019-11-28 03:54:20,395 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 41 [2019-11-28 03:54:20,396 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2019-11-28 03:54:20,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2019-11-28 03:54:20,398 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:20,399 INFO L688 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2019-11-28 03:54:20,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2019-11-28 03:54:20,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 29. [2019-11-28 03:54:20,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-28 03:54:20,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2019-11-28 03:54:20,405 INFO L711 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-28 03:54:20,405 INFO L591 BuchiCegarLoop]: Abstraction has 29 states and 36 transitions. [2019-11-28 03:54:20,405 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:54:20,406 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 36 transitions. [2019-11-28 03:54:20,407 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 03:54:20,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:20,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:20,411 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:20,411 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:54:20,411 INFO L794 eck$LassoCheckResult]: Stem: 337#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 332#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 333#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 336#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 318#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 319#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 343#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 342#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 338#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 340#L765-3 [2019-11-28 03:54:20,411 INFO L796 eck$LassoCheckResult]: Loop: 340#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 320#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 321#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 329#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 331#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 340#L765-3 [2019-11-28 03:54:20,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:20,413 INFO L82 PathProgramCache]: Analyzing trace with hash -594068688, now seen corresponding path program 1 times [2019-11-28 03:54:20,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:20,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35359492] [2019-11-28 03:54:20,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:20,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:20,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35359492] [2019-11-28 03:54:20,478 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:20,478 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:20,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [232456133] [2019-11-28 03:54:20,479 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:20,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:20,479 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 2 times [2019-11-28 03:54:20,479 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:20,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168386250] [2019-11-28 03:54:20,480 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:20,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:20,509 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:20,695 WARN L192 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-28 03:54:20,772 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:20,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:20,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:20,773 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2019-11-28 03:54:20,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:20,817 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2019-11-28 03:54:20,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:20,817 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 36 transitions. [2019-11-28 03:54:20,818 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 03:54:20,819 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 36 transitions. [2019-11-28 03:54:20,820 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2019-11-28 03:54:20,820 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2019-11-28 03:54:20,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 36 transitions. [2019-11-28 03:54:20,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:20,820 INFO L688 BuchiCegarLoop]: Abstraction has 30 states and 36 transitions. [2019-11-28 03:54:20,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 36 transitions. [2019-11-28 03:54:20,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2019-11-28 03:54:20,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-11-28 03:54:20,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 30 transitions. [2019-11-28 03:54:20,824 INFO L711 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-28 03:54:20,824 INFO L591 BuchiCegarLoop]: Abstraction has 24 states and 30 transitions. [2019-11-28 03:54:20,824 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:54:20,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 30 transitions. [2019-11-28 03:54:20,825 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2019-11-28 03:54:20,825 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:20,825 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:20,826 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:20,826 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-11-28 03:54:20,826 INFO L794 eck$LassoCheckResult]: Stem: 408#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 403#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 404#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 407#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 389#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 390#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 396#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 397#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 405#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 406#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 409#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 410#L765-3 [2019-11-28 03:54:20,826 INFO L796 eck$LassoCheckResult]: Loop: 410#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 391#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 392#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 400#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 402#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 410#L765-3 [2019-11-28 03:54:20,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:20,827 INFO L82 PathProgramCache]: Analyzing trace with hash 1010756116, now seen corresponding path program 1 times [2019-11-28 03:54:20,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:20,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084019308] [2019-11-28 03:54:20,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:20,855 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:20,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:20,857 INFO L82 PathProgramCache]: Analyzing trace with hash 67852142, now seen corresponding path program 3 times [2019-11-28 03:54:20,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:20,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704766440] [2019-11-28 03:54:20,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:20,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:20,874 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:20,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:20,875 INFO L82 PathProgramCache]: Analyzing trace with hash 754630971, now seen corresponding path program 1 times [2019-11-28 03:54:20,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:20,875 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [161578417] [2019-11-28 03:54:20,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:20,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:20,953 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:21,099 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 74 [2019-11-28 03:54:21,630 WARN L192 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 122 [2019-11-28 03:54:21,845 WARN L192 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2019-11-28 03:54:21,857 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:54:21,857 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:54:21,857 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:54:21,858 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:54:21,858 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:54:21,858 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:21,858 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:54:21,858 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:54:21,858 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration5_Lasso [2019-11-28 03:54:21,858 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:54:21,859 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:54:21,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,874 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,899 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:21,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:22,328 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 82 [2019-11-28 03:54:22,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:22,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:22,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:22,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:22,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:22,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:22,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:22,816 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-28 03:54:23,040 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-28 03:54:23,286 WARN L192 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2019-11-28 03:54:23,375 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:54:23,376 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 03:54:23,386 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 [2019-11-28 03:54:23,389 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,389 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,389 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,390 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,390 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,393 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) [2019-11-28 03:54:23,404 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 [2019-11-28 03:54:23,406 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,407 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,407 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,407 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,407 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,408 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,408 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,410 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) [2019-11-28 03:54:23,417 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 [2019-11-28 03:54:23,419 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,419 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,419 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,419 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,421 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,421 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:23,432 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 [2019-11-28 03:54:23,434 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,434 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,435 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,435 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,437 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,437 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,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 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,453 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 [2019-11-28 03:54:23,455 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,455 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,455 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,455 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,458 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,458 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,471 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 [2019-11-28 03:54:23,472 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,472 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,472 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,473 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,473 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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 [2019-11-28 03:54:23,480 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 [2019-11-28 03:54:23,481 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,483 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,483 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,487 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 [2019-11-28 03:54:23,492 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 [2019-11-28 03:54:23,493 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,493 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,493 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,493 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,494 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,494 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,494 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,495 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) [2019-11-28 03:54:23,507 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 [2019-11-28 03:54:23,509 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,509 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,509 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,510 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,510 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,512 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) [2019-11-28 03:54:23,527 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 [2019-11-28 03:54:23,529 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,529 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,529 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,529 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,529 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,530 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,530 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,539 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) [2019-11-28 03:54:23,547 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 [2019-11-28 03:54:23,549 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,551 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,552 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,555 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 [2019-11-28 03:54:23,560 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 [2019-11-28 03:54:23,561 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,561 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,561 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,561 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,562 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,562 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,562 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,563 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 [2019-11-28 03:54:23,568 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 [2019-11-28 03:54:23,569 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,569 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,569 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,569 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,569 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,570 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,570 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,572 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 [2019-11-28 03:54:23,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 [2019-11-28 03:54:23,580 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,580 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,580 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,580 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,582 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,582 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,585 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 [2019-11-28 03:54: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 [2019-11-28 03:54:23,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,593 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,600 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) [2019-11-28 03:54:23,607 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 [2019-11-28 03:54:23,608 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,608 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,609 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,609 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,609 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,610 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,610 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,612 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 [2019-11-28 03:54:23,619 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 [2019-11-28 03:54:23,621 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,621 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:54:23,621 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:54:23,622 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,639 INFO L401 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-28 03:54:23,639 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 03:54:23,678 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) [2019-11-28 03:54:23,690 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:54:23,692 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,692 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,692 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,692 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,694 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,694 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,700 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 [2019-11-28 03:54:23,714 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 [2019-11-28 03:54:23,716 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,716 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,716 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,716 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,717 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,717 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,720 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 [2019-11-28 03:54:23,725 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 [2019-11-28 03:54:23,726 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,726 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,727 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,727 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,727 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,727 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,727 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,729 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 [2019-11-28 03:54:23,739 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 [2019-11-28 03:54:23,740 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,741 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,741 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,741 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,742 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,743 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,751 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 [2019-11-28 03:54:23,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,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 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 45 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,763 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 [2019-11-28 03:54:23,765 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,765 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,767 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,767 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,775 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) [2019-11-28 03:54:23,788 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 [2019-11-28 03:54:23,790 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,790 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,790 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,790 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,792 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,792 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 46 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54: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 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 47 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,804 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 [2019-11-28 03:54:23,805 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,805 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,805 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,805 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,807 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,807 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,811 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) Waiting until toolchain timeout for monitored process 48 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,818 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 [2019-11-28 03:54:23,819 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,819 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,819 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,820 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,820 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,820 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,820 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,823 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:23,834 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 [2019-11-28 03:54:23,835 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,835 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,836 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,836 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,837 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,837 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 49 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,841 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 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 50 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,851 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 [2019-11-28 03:54:23,852 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,852 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:23,852 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,853 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:23,853 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:23,855 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 51 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 51 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,861 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 [2019-11-28 03:54:23,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,863 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,864 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,865 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:23,870 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 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:23,887 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 [2019-11-28 03:54:23,889 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,889 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,889 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,889 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,892 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,892 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 52 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,899 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) [2019-11-28 03:54:23,906 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 [2019-11-28 03:54:23,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:23,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:23,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:23,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:23,932 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:23,932 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 53 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:23,971 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:54:24,033 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-28 03:54:24,033 INFO L444 ModelExtractionUtils]: 24 out of 58 variables were initially zero. Simplification set additionally 31 variables to zero. 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) [2019-11-28 03:54:24,041 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 54 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:24,045 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:54:24,046 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:54:24,046 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~i~0, ULTIMATE.start_alloc_17_~len) = -1*ULTIMATE.start_alloc_17_~i~0 + 1*ULTIMATE.start_alloc_17_~len Supporting invariants [] [2019-11-28 03:54:24,089 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 03:54:24,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:24,126 INFO L255 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:54:24,127 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:24,139 INFO L255 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:54:24,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:24,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:24,153 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 [2019-11-28 03:54:24,153 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-11-28 03:54:24,182 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 30 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 43 states and 56 transitions. Complement of second has 6 states. [2019-11-28 03:54:24,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-28 03:54:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:54:24,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2019-11-28 03:54:24,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 5 letters. [2019-11-28 03:54:24,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:24,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 16 letters. Loop has 5 letters. [2019-11-28 03:54:24,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:24,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 32 transitions. Stem has 11 letters. Loop has 10 letters. [2019-11-28 03:54:24,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:24,185 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 43 states and 56 transitions. [2019-11-28 03:54:24,187 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 6 [2019-11-28 03:54:24,189 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 43 states to 31 states and 40 transitions. [2019-11-28 03:54:24,189 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-28 03:54:24,189 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2019-11-28 03:54:24,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 40 transitions. [2019-11-28 03:54:24,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:24,190 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 40 transitions. [2019-11-28 03:54:24,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 40 transitions. [2019-11-28 03:54:24,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-11-28 03:54:24,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:54:24,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 37 transitions. [2019-11-28 03:54:24,196 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-28 03:54:24,196 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 37 transitions. [2019-11-28 03:54:24,197 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:54:24,197 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 37 transitions. [2019-11-28 03:54:24,197 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:54:24,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:24,198 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:24,199 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:24,199 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:24,200 INFO L794 eck$LassoCheckResult]: Stem: 586#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 582#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 583#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 584#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 563#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 564#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 572#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 573#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 580#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 581#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 585#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 587#L765-3 assume !(alloc_17_~i~0 < alloc_17_~len); 561#L765-4 alloc_17_#res := 0; 562#L776 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 575#L780-3 [2019-11-28 03:54:24,200 INFO L796 eck$LassoCheckResult]: Loop: 575#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 574#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 575#L780-3 [2019-11-28 03:54:24,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,200 INFO L82 PathProgramCache]: Analyzing trace with hash -580221115, now seen corresponding path program 1 times [2019-11-28 03:54:24,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:24,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3818853] [2019-11-28 03:54:24,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:24,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:54:24,273 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3818853] [2019-11-28 03:54:24,274 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:24,274 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:24,274 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079837552] [2019-11-28 03:54:24,274 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:24,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,277 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 1 times [2019-11-28 03:54:24,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:24,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000178628] [2019-11-28 03:54:24,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:24,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,288 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:24,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:24,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:24,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:24,324 INFO L87 Difference]: Start difference. First operand 28 states and 37 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 03:54:24,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:24,396 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2019-11-28 03:54:24,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:24,397 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 67 states and 86 transitions. [2019-11-28 03:54:24,398 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2019-11-28 03:54:24,401 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 67 states to 67 states and 86 transitions. [2019-11-28 03:54:24,401 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 49 [2019-11-28 03:54:24,401 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2019-11-28 03:54:24,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 67 states and 86 transitions. [2019-11-28 03:54:24,402 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:24,403 INFO L688 BuchiCegarLoop]: Abstraction has 67 states and 86 transitions. [2019-11-28 03:54:24,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states and 86 transitions. [2019-11-28 03:54:24,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2019-11-28 03:54:24,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-28 03:54:24,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 48 transitions. [2019-11-28 03:54:24,409 INFO L711 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-28 03:54:24,409 INFO L591 BuchiCegarLoop]: Abstraction has 37 states and 48 transitions. [2019-11-28 03:54:24,409 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-28 03:54:24,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 37 states and 48 transitions. [2019-11-28 03:54:24,410 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:54:24,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:24,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:24,410 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:24,411 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:24,411 INFO L794 eck$LassoCheckResult]: Stem: 693#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 687#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 688#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 691#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 692#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 701#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 702#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 694#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 695#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 696#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 697#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 704#L765-3 assume !(alloc_17_~i~0 < alloc_17_~len); 668#L765-4 alloc_17_#res := 0; 669#L776 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 682#L780-3 [2019-11-28 03:54:24,411 INFO L796 eck$LassoCheckResult]: Loop: 682#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 681#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 682#L780-3 [2019-11-28 03:54:24,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,412 INFO L82 PathProgramCache]: Analyzing trace with hash -838386553, now seen corresponding path program 1 times [2019-11-28 03:54:24,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:24,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034850471] [2019-11-28 03:54:24,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:24,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:24,476 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:54:24,477 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034850471] [2019-11-28 03:54:24,477 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:24,477 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-28 03:54:24,477 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070627508] [2019-11-28 03:54:24,478 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:24,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,478 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 2 times [2019-11-28 03:54:24,478 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:24,478 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536167729] [2019-11-28 03:54:24,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:24,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,498 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:24,558 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:24,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-28 03:54:24,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 03:54:24,558 INFO L87 Difference]: Start difference. First operand 37 states and 48 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-11-28 03:54:24,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:24,613 INFO L93 Difference]: Finished difference Result 51 states and 64 transitions. [2019-11-28 03:54:24,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:24,614 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 51 states and 64 transitions. [2019-11-28 03:54:24,615 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 8 [2019-11-28 03:54:24,616 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 51 states to 51 states and 64 transitions. [2019-11-28 03:54:24,616 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 38 [2019-11-28 03:54:24,616 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2019-11-28 03:54:24,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 51 states and 64 transitions. [2019-11-28 03:54:24,617 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:24,617 INFO L688 BuchiCegarLoop]: Abstraction has 51 states and 64 transitions. [2019-11-28 03:54:24,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states and 64 transitions. [2019-11-28 03:54:24,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 28. [2019-11-28 03:54:24,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-28 03:54:24,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2019-11-28 03:54:24,619 INFO L711 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-28 03:54:24,619 INFO L591 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2019-11-28 03:54:24,619 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-28 03:54:24,620 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2019-11-28 03:54:24,620 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:54:24,620 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:24,620 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:24,621 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:24,621 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:24,621 INFO L794 eck$LassoCheckResult]: Stem: 792#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 787#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 788#L520 assume !(ldv_positive_~r~1 > 0);ldv_positive_#res := 1; 791#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 770#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 771#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 779#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 780#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 789#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 790#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 793#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 794#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 772#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 773#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 783#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 784#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 777#L772-3 [2019-11-28 03:54:24,621 INFO L796 eck$LassoCheckResult]: Loop: 777#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 776#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 777#L772-3 [2019-11-28 03:54:24,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,622 INFO L82 PathProgramCache]: Analyzing trace with hash 754690497, now seen corresponding path program 1 times [2019-11-28 03:54:24,622 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:24,622 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24586205] [2019-11-28 03:54:24,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,644 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:24,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,645 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 1 times [2019-11-28 03:54:24,645 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:24,645 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640039691] [2019-11-28 03:54:24,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:24,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,652 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:24,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,653 INFO L82 PathProgramCache]: Analyzing trace with hash -591903197, now seen corresponding path program 1 times [2019-11-28 03:54:24,653 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:24,653 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665076889] [2019-11-28 03:54:24,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:24,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:24,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:54:24,696 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665076889] [2019-11-28 03:54:24,696 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:24,696 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 03:54:24,697 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665756447] [2019-11-28 03:54:24,778 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:24,779 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:54:24,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:54:24,779 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. cyclomatic complexity: 12 Second operand 7 states. [2019-11-28 03:54:24,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:24,933 INFO L93 Difference]: Finished difference Result 71 states and 87 transitions. [2019-11-28 03:54:24,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-28 03:54:24,934 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 87 transitions. [2019-11-28 03:54:24,935 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 12 [2019-11-28 03:54:24,936 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 71 states and 87 transitions. [2019-11-28 03:54:24,936 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2019-11-28 03:54:24,936 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2019-11-28 03:54:24,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 87 transitions. [2019-11-28 03:54:24,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:24,937 INFO L688 BuchiCegarLoop]: Abstraction has 71 states and 87 transitions. [2019-11-28 03:54:24,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 87 transitions. [2019-11-28 03:54:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 47. [2019-11-28 03:54:24,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-11-28 03:54:24,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 61 transitions. [2019-11-28 03:54:24,941 INFO L711 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-11-28 03:54:24,941 INFO L591 BuchiCegarLoop]: Abstraction has 47 states and 61 transitions. [2019-11-28 03:54:24,941 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-28 03:54:24,941 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 61 transitions. [2019-11-28 03:54:24,942 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:54:24,942 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:24,942 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:24,943 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:24,943 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:24,943 INFO L794 eck$LassoCheckResult]: Stem: 914#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 909#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 910#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 917#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 935#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 934#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 933#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 932#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 911#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 912#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 916#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 918#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 893#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 894#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 905#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 906#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 899#L772-3 assume !(alloc_17_~j~0 >= 0); 900#L772-4 alloc_17_#res := 3; 890#L776 entry_point_#t~ret47 := alloc_17_#res;havoc entry_point_#t~ret47;free_17_#in~array.base, free_17_#in~array.offset, free_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc free_17_#t~mem43.base, free_17_#t~mem43.offset, free_17_#t~post42, free_17_~array.base, free_17_~array.offset, free_17_~len, free_17_~i~1;free_17_~array.base, free_17_~array.offset := free_17_#in~array.base, free_17_#in~array.offset;free_17_~len := free_17_#in~len;havoc free_17_~i~1;free_17_~i~1 := 0; 904#L780-3 [2019-11-28 03:54:24,944 INFO L796 eck$LassoCheckResult]: Loop: 904#L780-3 assume !!(free_17_~i~1 < free_17_~len);call free_17_#t~mem43.base, free_17_#t~mem43.offset := read~$Pointer$(free_17_~array.base, free_17_~array.offset + 4 * free_17_~i~1, 4);call ULTIMATE.dealloc(free_17_#t~mem43.base, free_17_#t~mem43.offset);havoc free_17_#t~mem43.base, free_17_#t~mem43.offset; 903#L780-2 free_17_#t~post42 := free_17_~i~1;free_17_~i~1 := 1 + free_17_#t~post42;havoc free_17_#t~post42; 904#L780-3 [2019-11-28 03:54:24,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,944 INFO L82 PathProgramCache]: Analyzing trace with hash 419216258, now seen corresponding path program 1 times [2019-11-28 03:54:24,944 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:24,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709406136] [2019-11-28 03:54:24,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,971 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:24,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,971 INFO L82 PathProgramCache]: Analyzing trace with hash 3683, now seen corresponding path program 3 times [2019-11-28 03:54:24,972 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:24,972 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135609483] [2019-11-28 03:54:24,972 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:24,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:24,979 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:24,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:24,980 INFO L82 PathProgramCache]: Analyzing trace with hash -860099164, now seen corresponding path program 1 times [2019-11-28 03:54:24,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:24,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989650506] [2019-11-28 03:54:24,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:25,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:25,008 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:25,734 WARN L192 SmtUtils]: Spent 699.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 157 [2019-11-28 03:54:25,944 WARN L192 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2019-11-28 03:54:25,947 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:54:25,947 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:54:25,947 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:54:25,948 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:54:25,948 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:54:25,948 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:25,948 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:54:25,948 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:54:25,948 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration9_Lasso [2019-11-28 03:54:25,948 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:54:25,948 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:54:25,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:25,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:25,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:25,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:25,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:25,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:25,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,360 WARN L192 SmtUtils]: Spent 275.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 78 [2019-11-28 03:54:26,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,434 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,440 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,464 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:26,783 WARN L192 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-11-28 03:54:27,074 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-28 03:54:27,183 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2019-11-28 03:54:27,289 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:54:27,289 INFO L489 LassoAnalysis]: Using template 'affine'. 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 [2019-11-28 03:54:27,298 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 [2019-11-28 03:54:27,299 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,299 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:27,299 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,299 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,299 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,300 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:27,300 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:27,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 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 [2019-11-28 03:54:27,308 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 [2019-11-28 03:54:27,310 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,310 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,310 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,310 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,311 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:27,311 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:27,314 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) [2019-11-28 03:54:27,320 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 57 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:27,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:27,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:27,324 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) [2019-11-28 03:54:27,329 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 [2019-11-28 03:54:27,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,332 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 58 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,333 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:27,333 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:27,343 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) [2019-11-28 03:54:27,350 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 [2019-11-28 03:54:27,352 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,353 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:27,353 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,353 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,353 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,354 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:27,354 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 59 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,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 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 [2019-11-28 03:54:27,380 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 [2019-11-28 03:54:27,381 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,381 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:27,381 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,381 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,381 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,382 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:27,382 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:27,383 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 [2019-11-28 03:54:27,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 [2019-11-28 03:54:27,391 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,393 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:27,393 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:27,396 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 [2019-11-28 03:54:27,401 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 [2019-11-28 03:54:27,404 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,404 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,404 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,404 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,406 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:27,406 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:27,411 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) [2019-11-28 03:54:27,425 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 [2019-11-28 03:54:27,427 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,427 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,427 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,427 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,430 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:27,430 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 63 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,437 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 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:27,443 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 [2019-11-28 03:54:27,445 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,445 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,445 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,445 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,446 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:27,446 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 64 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,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 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:27,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 [2019-11-28 03:54:27,458 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,458 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,458 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,458 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,459 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:27,459 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 65 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,463 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 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:27,470 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 [2019-11-28 03:54:27,471 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,471 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,472 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,472 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,473 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:27,473 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 66 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,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 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:27,483 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 [2019-11-28 03:54:27,484 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:27,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:27,485 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 67 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,487 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) [2019-11-28 03:54:27,493 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 [2019-11-28 03:54:27,495 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,495 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,495 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,495 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,496 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:27,497 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 68 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,500 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) [2019-11-28 03:54:27,507 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 [2019-11-28 03:54:27,508 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,509 INFO L203 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-28 03:54:27,509 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,509 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 69 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,512 INFO L401 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-28 03:54:27,513 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:27,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 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:27,535 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 [2019-11-28 03:54:27,537 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,537 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:27,537 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,537 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,538 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,538 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:27,538 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 70 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,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 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:27,546 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 [2019-11-28 03:54:27,548 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:27,549 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:27,549 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:27,549 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:27,558 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:27,558 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 71 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:27,582 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:54:27,654 INFO L443 ModelExtractionUtils]: Simplification made 24 calls to the SMT solver. [2019-11-28 03:54:27,654 INFO L444 ModelExtractionUtils]: 30 out of 55 variables were initially zero. Simplification set additionally 22 variables to zero. 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 [2019-11-28 03:54:27,661 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:54:27,667 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:54:27,667 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:54:27,667 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_free_17_~i~1, ULTIMATE.start_free_17_~len) = -1*ULTIMATE.start_free_17_~i~1 + 1*ULTIMATE.start_free_17_~len Supporting invariants [] [2019-11-28 03:54:27,695 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 03:54:27,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:27,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:27,737 INFO L255 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:54:27,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:27,746 INFO L255 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:54:27,746 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:27,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:27,759 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 [2019-11-28 03:54:27,760 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-11-28 03:54:27,774 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 61 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 49 states and 64 transitions. Complement of second has 4 states. [2019-11-28 03:54:27,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:54:27,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:54:27,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 29 transitions. [2019-11-28 03:54:27,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-28 03:54:27,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:27,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-28 03:54:27,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:27,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 29 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-28 03:54:27,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:27,777 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 49 states and 64 transitions. [2019-11-28 03:54:27,778 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:27,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 49 states to 23 states and 27 transitions. [2019-11-28 03:54:27,779 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:54:27,780 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:54:27,780 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 27 transitions. [2019-11-28 03:54:27,780 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:27,780 INFO L688 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-28 03:54:27,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states and 27 transitions. [2019-11-28 03:54:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-11-28 03:54:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:54:27,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2019-11-28 03:54:27,783 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-28 03:54:27,783 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 27 transitions. [2019-11-28 03:54:27,783 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-28 03:54:27,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 27 transitions. [2019-11-28 03:54:27,783 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:27,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:27,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:27,784 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:27,785 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:27,785 INFO L794 eck$LassoCheckResult]: Stem: 1124#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1120#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1121#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1122#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1104#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1105#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1112#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1113#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1118#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1119#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1123#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1125#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1108#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1109#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1116#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1117#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1126#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1106#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1107#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1114#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1115#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1111#L772-3 [2019-11-28 03:54:27,785 INFO L796 eck$LassoCheckResult]: Loop: 1111#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1110#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1111#L772-3 [2019-11-28 03:54:27,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:27,786 INFO L82 PathProgramCache]: Analyzing trace with hash 718228858, now seen corresponding path program 1 times [2019-11-28 03:54:27,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:27,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727130024] [2019-11-28 03:54:27,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:54:27,817 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727130024] [2019-11-28 03:54:27,817 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:54:27,817 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-28 03:54:27,817 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305330507] [2019-11-28 03:54:27,817 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:27,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:27,819 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 2 times [2019-11-28 03:54:27,819 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:27,819 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785141517] [2019-11-28 03:54:27,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:27,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:27,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:27,828 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:27,915 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:27,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 03:54:27,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 03:54:27,915 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-28 03:54:27,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:27,940 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2019-11-28 03:54:27,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 03:54:27,940 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 33 transitions. [2019-11-28 03:54:27,941 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-28 03:54:27,941 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 28 states and 31 transitions. [2019-11-28 03:54:27,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2019-11-28 03:54:27,941 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2019-11-28 03:54:27,941 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 31 transitions. [2019-11-28 03:54:27,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:27,942 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-28 03:54:27,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 31 transitions. [2019-11-28 03:54:27,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2019-11-28 03:54:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-28 03:54:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2019-11-28 03:54:27,944 INFO L711 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-28 03:54:27,944 INFO L591 BuchiCegarLoop]: Abstraction has 23 states and 26 transitions. [2019-11-28 03:54:27,944 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-28 03:54:27,944 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 26 transitions. [2019-11-28 03:54:27,944 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:27,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:27,945 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:27,946 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:27,946 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:27,946 INFO L794 eck$LassoCheckResult]: Stem: 1185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1180#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1181#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1184#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1166#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1167#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1174#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1175#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1182#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1183#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1186#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1187#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1170#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1171#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1178#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1179#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1188#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1168#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1169#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1176#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1177#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1173#L772-3 [2019-11-28 03:54:27,946 INFO L796 eck$LassoCheckResult]: Loop: 1173#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1172#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1173#L772-3 [2019-11-28 03:54:27,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:27,947 INFO L82 PathProgramCache]: Analyzing trace with hash 38170488, now seen corresponding path program 1 times [2019-11-28 03:54:27,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:27,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253014319] [2019-11-28 03:54:27,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:28,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253014319] [2019-11-28 03:54:28,018 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [275319101] [2019-11-28 03:54:28,019 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 73 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:54:28,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:28,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:54:28,088 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:28,133 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:28,133 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:54:28,133 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2019-11-28 03:54:28,133 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410022128] [2019-11-28 03:54:28,134 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:54:28,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:28,134 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 3 times [2019-11-28 03:54:28,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:28,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437647657] [2019-11-28 03:54:28,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:28,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:28,143 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:28,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:54:28,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-28 03:54:28,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-11-28 03:54:28,233 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. cyclomatic complexity: 6 Second operand 10 states. [2019-11-28 03:54:28,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:54:28,336 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2019-11-28 03:54:28,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:54:28,337 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 36 transitions. [2019-11-28 03:54:28,337 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:28,338 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 26 states and 29 transitions. [2019-11-28 03:54:28,338 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:54:28,338 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:54:28,338 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 29 transitions. [2019-11-28 03:54:28,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:54:28,339 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-11-28 03:54:28,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 29 transitions. [2019-11-28 03:54:28,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-28 03:54:28,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-28 03:54:28,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-11-28 03:54:28,340 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-28 03:54:28,340 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-11-28 03:54:28,341 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-28 03:54:28,341 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 28 transitions. [2019-11-28 03:54:28,341 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-28 03:54:28,341 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:54:28,341 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:54:28,342 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:54:28,342 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-28 03:54:28,342 INFO L794 eck$LassoCheckResult]: Stem: 1320#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset := #Ultimate.allocOnStack(8);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, 4);call write~init~$Pointer$(~#ldv_global_msg_list~0.base, ~#ldv_global_msg_list~0.offset, ~#ldv_global_msg_list~0.base, 4 + ~#ldv_global_msg_list~0.offset, 4); 1317#L-1 havoc entry_point_#t~ret44, entry_point_#t~ret45.base, entry_point_#t~ret45.offset, entry_point_#t~post46, entry_point_#t~ret47, entry_point_~i~2, entry_point_~len~0, entry_point_~array~0.base, entry_point_~array~0.offset;havoc entry_point_~i~2;havoc ldv_positive_#res;havoc ldv_positive_#t~nondet4, ldv_positive_~r~1;ldv_positive_~r~1 := ldv_positive_#t~nondet4;havoc ldv_positive_#t~nondet4; 1318#L520 assume ldv_positive_~r~1 > 0;ldv_positive_#res := ldv_positive_~r~1; 1319#L521 entry_point_#t~ret44 := ldv_positive_#res;entry_point_~len~0 := entry_point_#t~ret44;havoc entry_point_#t~ret44;assume 0 != (if entry_point_~len~0 < 16777216 then 1 else 0);ldv_malloc_#in~size := 4 * entry_point_~len~0;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1301#L526 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1302#L529 entry_point_#t~ret45.base, entry_point_#t~ret45.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;entry_point_~array~0.base, entry_point_~array~0.offset := entry_point_#t~ret45.base, entry_point_#t~ret45.offset;havoc entry_point_#t~ret45.base, entry_point_#t~ret45.offset; 1309#L789 assume entry_point_~array~0.base != 0 || entry_point_~array~0.offset != 0;entry_point_~i~2 := 0; 1310#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1321#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1322#L790-3 assume !!(entry_point_~i~2 < entry_point_~len~0);call write~$Pointer$(0, 0, entry_point_~array~0.base, entry_point_~array~0.offset + 4 * entry_point_~i~2, 4); 1315#L790-2 entry_point_#t~post46 := entry_point_~i~2;entry_point_~i~2 := 1 + entry_point_#t~post46;havoc entry_point_#t~post46; 1316#L790-3 assume !(entry_point_~i~2 < entry_point_~len~0); 1323#L790-4 alloc_17_#in~array.base, alloc_17_#in~array.offset, alloc_17_#in~len := entry_point_~array~0.base, entry_point_~array~0.offset, entry_point_~len~0;havoc alloc_17_#res;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset, alloc_17_#t~post38, alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset, alloc_17_#t~post40, alloc_17_~array.base, alloc_17_~array.offset, alloc_17_~len, alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~i~0, alloc_17_~j~0;alloc_17_~array.base, alloc_17_~array.offset := alloc_17_#in~array.base, alloc_17_#in~array.offset;alloc_17_~len := alloc_17_#in~len;havoc alloc_17_~p~0.base, alloc_17_~p~0.offset;alloc_17_~i~0 := 0;havoc alloc_17_~j~0; 1324#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1305#L526-1 assume 0 != ldv_malloc_#t~nondet11;havoc ldv_malloc_#t~nondet11;call ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset := #Ultimate.allocOnHeap(ldv_malloc_~size);ldv_malloc_#res.base, ldv_malloc_#res.offset := ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset; 1306#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1313#L767 assume !(alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0);call write~$Pointer$(alloc_17_~p~0.base, alloc_17_~p~0.offset, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~i~0, 4); 1314#L765-2 alloc_17_#t~post38 := alloc_17_~i~0;alloc_17_~i~0 := 1 + alloc_17_#t~post38;havoc alloc_17_#t~post38; 1325#L765-3 assume !!(alloc_17_~i~0 < alloc_17_~len);ldv_malloc_#in~size := 4;havoc ldv_malloc_#res.base, ldv_malloc_#res.offset;havoc ldv_malloc_#t~nondet11, ldv_malloc_#t~malloc12.base, ldv_malloc_#t~malloc12.offset, ldv_malloc_~size;ldv_malloc_~size := ldv_malloc_#in~size; 1303#L526-1 assume !(0 != ldv_malloc_#t~nondet11);havoc ldv_malloc_#t~nondet11;ldv_malloc_#res.base, ldv_malloc_#res.offset := 0, 0; 1304#L529-1 alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset := ldv_malloc_#res.base, ldv_malloc_#res.offset;alloc_17_~p~0.base, alloc_17_~p~0.offset := alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset;havoc alloc_17_#t~ret39.base, alloc_17_#t~ret39.offset; 1311#L767 assume alloc_17_~p~0.base == 0 && alloc_17_~p~0.offset == 0; 1312#L767-1 alloc_17_~j~0 := alloc_17_~i~0 - 1; 1308#L772-3 [2019-11-28 03:54:28,342 INFO L796 eck$LassoCheckResult]: Loop: 1308#L772-3 assume !!(alloc_17_~j~0 >= 0);call alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset := read~$Pointer$(alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4);call ULTIMATE.dealloc(alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset);havoc alloc_17_#t~mem41.base, alloc_17_#t~mem41.offset;call write~$Pointer$(0, 0, alloc_17_~array.base, alloc_17_~array.offset + 4 * alloc_17_~j~0, 4); 1307#L772-2 alloc_17_#t~post40 := alloc_17_~j~0;alloc_17_~j~0 := alloc_17_#t~post40 - 1;havoc alloc_17_#t~post40; 1308#L772-3 [2019-11-28 03:54:28,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:28,343 INFO L82 PathProgramCache]: Analyzing trace with hash -2124874406, now seen corresponding path program 2 times [2019-11-28 03:54:28,343 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:28,343 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626854648] [2019-11-28 03:54:28,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:28,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:28,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:28,379 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:28,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:28,380 INFO L82 PathProgramCache]: Analyzing trace with hash 3171, now seen corresponding path program 4 times [2019-11-28 03:54:28,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:28,380 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923630507] [2019-11-28 03:54:28,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:28,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:28,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:28,387 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:28,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:28,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1894836356, now seen corresponding path program 1 times [2019-11-28 03:54:28,387 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:54:28,387 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595567324] [2019-11-28 03:54:28,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:54:28,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:28,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:54:28,425 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:54:30,217 WARN L192 SmtUtils]: Spent 1.69 s on a formula simplification. DAG size of input: 252 DAG size of output: 213 [2019-11-28 03:54:30,273 INFO L508 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:54:30,601 WARN L192 SmtUtils]: Spent 327.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2019-11-28 03:54:30,602 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:54:30,608 INFO L508 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-28 03:54:30,908 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-28 03:54:30,909 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:54:30,911 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2019-11-28 03:54:30,912 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:334, output treesize:326 [2019-11-28 03:54:31,226 WARN L192 SmtUtils]: Spent 314.00 ms on a formula simplification that was a NOOP. DAG size: 136 [2019-11-28 03:54:31,229 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:54:31,229 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:54:31,230 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:54:31,230 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:54:31,230 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:54:31,230 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:31,230 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:54:31,230 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:54:31,230 INFO L133 ssoRankerPreferences]: Filename of dumped script: memleaks_test17_2-2.i_Iteration12_Lasso [2019-11-28 03:54:31,230 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:54:31,230 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:54:31,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,285 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,724 WARN L192 SmtUtils]: Spent 282.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 81 [2019-11-28 03:54:31,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:31,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-28 03:54:32,166 WARN L192 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-28 03:54:32,584 WARN L192 SmtUtils]: Spent 289.00 ms on a formula simplification. DAG size of input: 34 DAG size of output: 34 [2019-11-28 03:54:32,732 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:54:32,732 INFO L489 LassoAnalysis]: Using template 'affine'. 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) [2019-11-28 03:54:32,741 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 [2019-11-28 03:54:32,742 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,743 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,743 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,743 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,743 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,743 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,744 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 74 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:32,745 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 [2019-11-28 03:54:32,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 [2019-11-28 03:54:32,753 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,754 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:32,754 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:32,758 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) [2019-11-28 03:54:32,768 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 [2019-11-28 03:54:32,770 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,770 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,770 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,770 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,771 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:32,772 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 76 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:32,778 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 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:32,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 [2019-11-28 03:54:32,791 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,791 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,791 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,791 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,793 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:32,793 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 77 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:32,796 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 78 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 78 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:32,801 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 [2019-11-28 03:54:32,802 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,802 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,802 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,802 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,802 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,803 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,803 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:32,804 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 79 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 79 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:32,810 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 [2019-11-28 03:54:32,812 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,812 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,812 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,812 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,812 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:32,815 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 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 [2019-11-28 03:54:32,826 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 [2019-11-28 03:54:32,828 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,828 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,828 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,828 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,829 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:32,830 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:32,833 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 [2019-11-28 03:54:32,839 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 [2019-11-28 03:54:32,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:32,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:32,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 82 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:54:32,851 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 [2019-11-28 03:54:32,853 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,853 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,853 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,853 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,855 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:32,856 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:32,861 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 [2019-11-28 03:54:32,866 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 [2019-11-28 03:54:32,867 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,867 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,867 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,868 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,868 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:32,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 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 [2019-11-28 03:54:32,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 [2019-11-28 03:54:32,876 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,876 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,876 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,876 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,878 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:32,878 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:32,883 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) [2019-11-28 03:54:32,894 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 [2019-11-28 03:54:32,895 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,895 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,897 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 85 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:32,898 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) Waiting until toolchain timeout for monitored process 86 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:32,903 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 [2019-11-28 03:54:32,904 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,904 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,905 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,905 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,905 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:32,906 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:32,908 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 [2019-11-28 03:54:32,915 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 [2019-11-28 03:54:32,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,917 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,917 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:32,918 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 [2019-11-28 03:54:32,925 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 [2019-11-28 03:54:32,926 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,926 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,926 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,926 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,926 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,927 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,927 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:32,928 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 [2019-11-28 03:54:32,934 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 [2019-11-28 03:54:32,935 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,935 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,935 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,935 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,936 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,936 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,936 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:32,937 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) Waiting until toolchain timeout for monitored process 90 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:32,943 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 [2019-11-28 03:54:32,944 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,944 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,945 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,945 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,945 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,945 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,945 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:32,946 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 [2019-11-28 03:54:32,951 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 [2019-11-28 03:54:32,953 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,953 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,953 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,953 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,953 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,953 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,953 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:32,954 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 [2019-11-28 03:54:32,961 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 [2019-11-28 03:54:32,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,964 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:32,964 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:32,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 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 [2019-11-28 03:54:32,974 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 [2019-11-28 03:54:32,975 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,975 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,975 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,975 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,976 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,976 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,976 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:32,977 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 [2019-11-28 03:54:32,984 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 [2019-11-28 03:54:32,985 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,985 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,985 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,985 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,985 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,986 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,986 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:32,987 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 [2019-11-28 03:54:32,993 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 [2019-11-28 03:54:32,995 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:32,996 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:32,996 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:32,996 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:32,996 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:32,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:32,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:33,005 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 [2019-11-28 03:54:33,011 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 [2019-11-28 03:54:33,012 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,012 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:33,012 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,012 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,012 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,013 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:33,013 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:33,014 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 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 [2019-11-28 03:54:33,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 [2019-11-28 03:54:33,022 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,022 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,022 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,022 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,023 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:33,023 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:33,025 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 98 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 98 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:33,031 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 [2019-11-28 03:54:33,032 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,032 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:33,032 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,032 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,032 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,033 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:33,033 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:33,034 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 99 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 99 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:33,039 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 [2019-11-28 03:54:33,041 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,042 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:33,042 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:33,045 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 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 [2019-11-28 03:54:33,050 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 [2019-11-28 03:54:33,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,054 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:33,054 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:33,063 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) [2019-11-28 03:54:33,074 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 [2019-11-28 03:54:33,075 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:33,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,076 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,076 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,076 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:33,077 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 101 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:33,078 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) [2019-11-28 03:54:33,085 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 [2019-11-28 03:54:33,086 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,086 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:33,086 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,087 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,087 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,087 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:33,087 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 102 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:33,089 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) [2019-11-28 03:54:33,096 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 [2019-11-28 03:54:33,097 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,097 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:33,097 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,097 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,098 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,098 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:33,098 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 103 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:33,100 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) [2019-11-28 03:54:33,106 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 [2019-11-28 03:54:33,108 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,109 INFO L203 nArgumentSynthesizer]: 4 stem disjuncts [2019-11-28 03:54:33,109 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,109 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,116 INFO L401 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-28 03:54:33,116 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 104 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:33,133 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) [2019-11-28 03:54:33,139 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 [2019-11-28 03:54:33,141 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,141 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,141 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,141 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,145 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:33,145 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 105 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:33,152 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) [2019-11-28 03:54:33,159 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 [2019-11-28 03:54:33,160 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,160 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,160 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,160 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,162 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:33,162 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. Waiting until toolchain timeout for monitored process 106 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:54:33,166 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 [2019-11-28 03:54:33,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 [2019-11-28 03:54:33,173 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,173 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:54:33,174 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,174 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,174 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,174 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:54:33,174 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:54:33,176 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 [2019-11-28 03:54:33,181 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 [2019-11-28 03:54:33,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:54:33,183 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:54:33,183 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:54:33,183 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:54:33,194 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:54:33,194 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:54:33,212 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:54:33,228 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-28 03:54:33,228 INFO L444 ModelExtractionUtils]: 29 out of 46 variables were initially zero. Simplification set additionally 14 variables to zero. 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 [2019-11-28 03:54:33,232 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:54:33,234 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:54:33,235 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:54:33,235 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_alloc_17_~j~0) = 2*ULTIMATE.start_alloc_17_~j~0 + 1 Supporting invariants [] [2019-11-28 03:54:33,269 INFO L297 tatePredicateManager]: 9 out of 9 supporting invariants were superfluous and have been removed [2019-11-28 03:54:33,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:54:33,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:33,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:54:33,326 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:54:33,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-28 03:54:33,333 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:54:33,346 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:54:33,347 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 [2019-11-28 03:54:33,347 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-28 03:54:33,355 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states and 28 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 27 states and 31 transitions. Complement of second has 4 states. [2019-11-28 03:54:33,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-28 03:54:33,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-28 03:54:33,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 21 transitions. [2019-11-28 03:54:33,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 2 letters. [2019-11-28 03:54:33,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:33,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 25 letters. Loop has 2 letters. [2019-11-28 03:54:33,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:33,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 21 transitions. Stem has 23 letters. Loop has 4 letters. [2019-11-28 03:54:33,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:54:33,358 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 31 transitions. [2019-11-28 03:54:33,359 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:54:33,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 0 states and 0 transitions. [2019-11-28 03:54:33,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:54:33,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:54:33,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:54:33,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:54:33,359 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:54:33,359 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:54:33,360 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:54:33,360 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-28 03:54:33,360 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:54:33,360 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:54:33,360 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:54:33,367 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:54:33 BoogieIcfgContainer [2019-11-28 03:54:33,367 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:54:33,367 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:54:33,367 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:54:33,368 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:54:33,368 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:54:16" (3/4) ... [2019-11-28 03:54:33,372 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:54:33,372 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:54:33,374 INFO L168 Benchmark]: Toolchain (without parser) took 18496.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 398.5 MB). Free memory was 953.6 MB in the beginning and 946.0 MB in the end (delta: 7.7 MB). Peak memory consumption was 406.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:33,374 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:33,375 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:33,375 INFO L168 Benchmark]: Boogie Procedure Inliner took 82.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:33,375 INFO L168 Benchmark]: Boogie Preprocessor took 31.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:33,376 INFO L168 Benchmark]: RCFGBuilder took 466.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:33,376 INFO L168 Benchmark]: BuchiAutomizer took 17106.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 271.1 MB). Free memory was 1.1 GB in the beginning and 946.0 MB in the end (delta: 112.4 MB). Peak memory consumption was 383.4 MB. Max. memory is 11.5 GB. [2019-11-28 03:54:33,376 INFO L168 Benchmark]: Witness Printer took 4.83 ms. Allocated memory is still 1.4 GB. Free memory is still 946.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:54:33,379 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 800.21 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 127.4 MB). Free memory was 953.6 MB in the beginning and 1.1 GB in the end (delta: -136.1 MB). Peak memory consumption was 26.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 82.12 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.00 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 466.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 17106.75 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 271.1 MB). Free memory was 1.1 GB in the beginning and 946.0 MB in the end (delta: 112.4 MB). Peak memory consumption was 383.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.83 ms. Allocated memory is still 1.4 GB. Free memory is still 946.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 12 terminating modules (8 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * array + -4 * i + unknown-#length-unknown[malloc(size)] and consists of 6 locations. One deterministic module has affine ranking function -1 * i + len and consists of 4 locations. One deterministic module has affine ranking function -1 * i + len and consists of 3 locations. One deterministic module has affine ranking function 2 * j + 1 and consists of 3 locations. 8 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 17.0s and 13 iterations. TraceHistogramMax:2. Analysis of lassos took 15.6s. Construction of modules took 0.3s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 7. Automata minimization 0.0s AutomataMinimizationTime, 11 MinimizatonAttempts, 126 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 47 states and ocurred in iteration 8. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 344 SDtfs, 483 SDslu, 534 SDs, 0 SdLazy, 280 SolverSat, 33 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU7 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital315 mio100 ax110 hnf100 lsp83 ukn59 mio100 lsp53 div100 bol100 ite100 ukn100 eq190 hnf89 smp96 dnf110 smp97 tf100 neg98 sie106 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 61ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 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...