./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-recursive-malloc/rec_malloc_ex11D.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 570a3560ecb7b29b974852ea58d8cc903e7c487d ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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:04:27,826 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 03:04:27,829 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 03:04:27,848 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 03:04:27,849 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 03:04:27,851 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 03:04:27,853 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 03:04:27,862 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 03:04:27,867 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 03:04:27,872 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 03:04:27,873 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 03:04:27,875 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 03:04:27,875 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 03:04:27,878 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 03:04:27,879 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 03:04:27,881 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 03:04:27,882 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 03:04:27,883 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 03:04:27,886 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 03:04:27,890 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 03:04:27,894 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 03:04:27,899 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 03:04:27,900 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 03:04:27,902 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 03:04:27,906 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 03:04:27,907 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 03:04:27,907 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 03:04:27,909 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 03:04:27,910 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 03:04:27,911 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 03:04:27,911 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 03:04:27,912 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 03:04:27,912 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 03:04:27,913 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 03:04:27,915 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 03:04:27,915 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 03:04:27,916 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 03:04:27,916 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 03:04:27,917 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 03:04:27,918 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 03:04:27,919 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 03:04:27,920 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-28 03:04:27,963 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 03:04:27,963 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 03:04:27,964 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 03:04:27,967 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 03:04:27,967 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 03:04:27,968 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-28 03:04:27,968 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-28 03:04:27,968 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-28 03:04:27,968 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-28 03:04:27,970 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-28 03:04:27,970 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-28 03:04:27,971 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 03:04:27,971 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-28 03:04:27,971 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 03:04:27,972 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 03:04:27,973 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-28 03:04:27,973 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-28 03:04:27,973 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-28 03:04:27,974 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 03:04:27,974 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-28 03:04:27,974 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 03:04:27,974 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-28 03:04:27,975 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 03:04:27,976 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 03:04:27,976 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-28 03:04:27,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 03:04:27,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 03:04:27,977 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-28 03:04:27,978 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-28 03:04:27,978 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 570a3560ecb7b29b974852ea58d8cc903e7c487d [2019-11-28 03:04:28,304 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 03:04:28,320 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 03:04:28,325 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 03:04:28,326 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 03:04:28,327 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 03:04:28,329 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i [2019-11-28 03:04:28,401 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304e4e990/3fa3efc902c04c72b6fb73a91aef9aae/FLAG9bc73587e [2019-11-28 03:04:28,838 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 03:04:28,839 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11D.i [2019-11-28 03:04:28,846 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304e4e990/3fa3efc902c04c72b6fb73a91aef9aae/FLAG9bc73587e [2019-11-28 03:04:29,201 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/304e4e990/3fa3efc902c04c72b6fb73a91aef9aae [2019-11-28 03:04:29,205 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 03:04:29,207 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 03:04:29,208 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 03:04:29,209 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 03:04:29,212 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 03:04:29,213 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:04:29" (1/1) ... [2019-11-28 03:04:29,216 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@281e5afc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29, skipping insertion in model container [2019-11-28 03:04:29,217 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:04:29" (1/1) ... [2019-11-28 03:04:29,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 03:04:29,250 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 03:04:29,513 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:04:29,527 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 03:04:29,552 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 03:04:29,571 INFO L208 MainTranslator]: Completed translation [2019-11-28 03:04:29,572 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29 WrapperNode [2019-11-28 03:04:29,572 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 03:04:29,573 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 03:04:29,573 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 03:04:29,574 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 03:04:29,583 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:04:29" (1/1) ... [2019-11-28 03:04:29,596 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:04:29" (1/1) ... [2019-11-28 03:04:29,681 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 03:04:29,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 03:04:29,682 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 03:04:29,682 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 03:04:29,691 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29" (1/1) ... [2019-11-28 03:04:29,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29" (1/1) ... [2019-11-28 03:04:29,703 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29" (1/1) ... [2019-11-28 03:04:29,703 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29" (1/1) ... [2019-11-28 03:04:29,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29" (1/1) ... [2019-11-28 03:04:29,713 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29" (1/1) ... [2019-11-28 03:04:29,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29" (1/1) ... [2019-11-28 03:04:29,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 03:04:29,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 03:04:29,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 03:04:29,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 03:04:29,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29" (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:04:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-28 03:04:29,776 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2019-11-28 03:04:29,776 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2019-11-28 03:04:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-28 03:04:29,777 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 03:04:29,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 03:04:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-28 03:04:29,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-28 03:04:30,065 INFO L292 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 03:04:30,068 INFO L297 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 03:04:30,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:30 BoogieIcfgContainer [2019-11-28 03:04:30,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 03:04:30,072 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-28 03:04:30,073 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-28 03:04:30,079 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-28 03:04:30,080 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:30,081 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.11 03:04:29" (1/3) ... [2019-11-28 03:04:30,083 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a81d89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:04:30, skipping insertion in model container [2019-11-28 03:04:30,083 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:30,083 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:04:29" (2/3) ... [2019-11-28 03:04:30,084 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a81d89c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.11 03:04:30, skipping insertion in model container [2019-11-28 03:04:30,084 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-28 03:04:30,084 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:30" (3/3) ... [2019-11-28 03:04:30,086 INFO L371 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11D.i [2019-11-28 03:04:30,151 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-28 03:04:30,151 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-28 03:04:30,152 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-28 03:04:30,152 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 03:04:30,152 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 03:04:30,152 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-28 03:04:30,152 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 03:04:30,152 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-28 03:04:30,166 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 03:04:30,196 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:04:30,197 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:30,197 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:30,207 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:04:30,207 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:30,207 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-28 03:04:30,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2019-11-28 03:04:30,211 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:04:30,211 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:30,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:30,212 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:04:30,212 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:30,221 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 12#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 7#L30-3true [2019-11-28 03:04:30,221 INFO L796 eck$LassoCheckResult]: Loop: 7#L30-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 10#L30-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 17#L34true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 8#L38true call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 6#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 13#L9true assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 18#recFINALtrue assume true; 15#recEXITtrue >#44#return; 5#L38-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 20#L38-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 7#L30-3true [2019-11-28 03:04:30,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:30,229 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2019-11-28 03:04:30,238 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:30,239 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216257059] [2019-11-28 03:04:30,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:30,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:30,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:30,384 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:30,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:30,386 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2019-11-28 03:04:30,386 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:30,386 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320051189] [2019-11-28 03:04:30,387 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:30,610 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:04:30,611 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320051189] [2019-11-28 03:04:30,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 03:04:30,612 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-28 03:04:30,612 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085226022] [2019-11-28 03:04:30,618 INFO L811 eck$LassoCheckResult]: loop already infeasible [2019-11-28 03:04:30,619 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:04:30,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-28 03:04:30,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-28 03:04:30,633 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2019-11-28 03:04:30,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:30,804 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2019-11-28 03:04:30,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-28 03:04:30,807 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2019-11-28 03:04:30,810 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:04:30,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2019-11-28 03:04:30,818 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-11-28 03:04:30,819 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-11-28 03:04:30,820 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2019-11-28 03:04:30,821 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:30,822 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 03:04:30,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2019-11-28 03:04:30,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-11-28 03:04:30,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-11-28 03:04:30,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2019-11-28 03:04:30,854 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 03:04:30,855 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2019-11-28 03:04:30,855 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-28 03:04:30,855 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2019-11-28 03:04:30,859 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2019-11-28 03:04:30,859 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:30,860 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:30,860 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-28 03:04:30,861 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:30,861 INFO L794 eck$LassoCheckResult]: Stem: 72#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 70#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 65#L30-3 [2019-11-28 03:04:30,861 INFO L796 eck$LassoCheckResult]: Loop: 65#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 66#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 67#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 61#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 59#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 62#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 60#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 59#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 62#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 71#recFINAL assume true; 73#recEXIT >#42#return; 68#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 69#recFINAL assume true; 74#recEXIT >#44#return; 63#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 64#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 65#L30-3 [2019-11-28 03:04:30,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:30,862 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2019-11-28 03:04:30,862 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:30,863 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638421246] [2019-11-28 03:04:30,863 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:30,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:30,910 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:30,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:30,911 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2019-11-28 03:04:30,911 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:30,912 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269648527] [2019-11-28 03:04:30,912 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:30,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:31,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:31,010 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:31,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:31,011 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2019-11-28 03:04:31,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:31,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903928385] [2019-11-28 03:04:31,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:31,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:31,106 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:31,644 WARN L192 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 93 [2019-11-28 03:04:31,896 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 82 [2019-11-28 03:04:32,009 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-28 03:04:32,659 WARN L192 SmtUtils]: Spent 643.00 ms on a formula simplification. DAG size of input: 144 DAG size of output: 124 [2019-11-28 03:04:32,818 WARN L192 SmtUtils]: Spent 135.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-11-28 03:04:32,951 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:04:32,952 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:04:32,952 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:04:32,952 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:04:32,952 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:04:32,952 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:32,953 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:04:32,953 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:04:32,953 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration2_Lasso [2019-11-28 03:04:32,953 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:04:32,953 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:04:32,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:04:32,981 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:04:32,983 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:04:32,986 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:04:32,992 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:04:32,995 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:04:32,999 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:04:33,011 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:04:33,372 WARN L192 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-11-28 03:04:33,375 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:04:33,379 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:04:33,929 WARN L192 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 26 [2019-11-28 03:04:34,017 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:04:34,022 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:04:34,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:34,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:34,038 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:34,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:34,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:34,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:34,042 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:34,042 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:04:34,060 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:04:34,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:04:34,076 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:34,076 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:34,076 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:34,077 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:34,077 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:34,078 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:34,078 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:34,080 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:04:34,089 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:34,091 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:34,091 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:34,091 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:34,091 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:34,092 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:34,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:34,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:34,111 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:04:34,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:34,132 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:34,132 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:34,132 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:34,133 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:34,136 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:34,136 INFO L402 nArgumentSynthesizer]: A total of 2 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:04:34,140 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:04:34,156 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:34,157 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:34,158 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:34,158 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:34,158 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:34,158 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:34,159 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:34,159 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:34,161 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:04:34,180 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:34,182 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:34,182 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:34,182 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:34,182 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:34,185 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:34,185 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:34,189 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:34,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:04:34,206 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:34,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:34,207 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:34,207 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:34,207 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:34,208 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:34,208 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:34,212 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:04:34,221 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:34,224 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:34,224 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:34,224 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:34,224 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:34,230 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:34,231 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:34,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 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:04:34,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:34,256 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:34,256 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:34,256 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:34,256 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:34,257 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:34,261 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:34,261 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:34,264 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:34,273 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:34,274 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:34,274 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:34,274 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:34,275 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:34,278 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:34,278 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:34,283 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:04:34,314 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-28 03:04:34,314 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:34,332 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:34,339 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:04:34,339 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:04:34,341 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~qq~0.base) ULTIMATE.start_main_~qq~0.offset)_1 Supporting invariants [] [2019-11-28 03:04:34,395 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-28 03:04:34,412 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:04:34,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:34,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:34,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 03:04:34,449 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:34,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:34,523 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-28 03:04:34,528 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:34,595 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:34,595 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-11-28 03:04:34,596 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:34,606 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:34,616 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2019-11-28 03:04:34,617 INFO L508 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:34,628 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:34,629 INFO L508 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:34,630 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2019-11-28 03:04:34,650 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2019-11-28 03:04:34,651 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:34,658 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:34,658 INFO L508 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:34,658 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2019-11-28 03:04:34,727 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-28 03:04:34,732 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2019-11-28 03:04:34,733 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2019-11-28 03:04:34,904 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2019-11-28 03:04:34,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2019-11-28 03:04:34,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-28 03:04:34,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2019-11-28 03:04:34,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2019-11-28 03:04:34,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:34,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2019-11-28 03:04:34,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:34,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2019-11-28 03:04:34,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:34,918 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2019-11-28 03:04:34,931 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-28 03:04:34,939 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2019-11-28 03:04:34,941 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2019-11-28 03:04:34,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-28 03:04:34,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-11-28 03:04:34,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:04:34,942 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-11-28 03:04:34,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-11-28 03:04:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2019-11-28 03:04:34,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 03:04:34,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2019-11-28 03:04:34,958 INFO L711 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-11-28 03:04:34,958 INFO L591 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2019-11-28 03:04:34,958 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-28 03:04:34,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2019-11-28 03:04:34,963 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-28 03:04:34,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:34,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:34,964 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:34,965 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:04:34,965 INFO L794 eck$LassoCheckResult]: Stem: 275#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 273#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 274#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 262#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 280#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 263#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 264#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 296#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 248#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 246#recENTRY [2019-11-28 03:04:34,965 INFO L796 eck$LassoCheckResult]: Loop: 246#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 249#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 247#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 246#recENTRY [2019-11-28 03:04:34,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:34,966 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2019-11-28 03:04:34,966 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:34,966 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404443812] [2019-11-28 03:04:34,967 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:35,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:35,073 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:35,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:35,076 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2019-11-28 03:04:35,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:35,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975891007] [2019-11-28 03:04:35,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:35,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:35,111 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:35,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:35,111 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2019-11-28 03:04:35,111 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:35,112 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440403930] [2019-11-28 03:04:35,112 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:35,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:35,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:35,159 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:35,315 WARN L192 SmtUtils]: Spent 151.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 64 [2019-11-28 03:04:35,651 WARN L192 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-11-28 03:04:36,151 WARN L192 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 92 [2019-11-28 03:04:36,301 WARN L192 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 03:04:36,780 WARN L192 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 106 [2019-11-28 03:04:36,923 WARN L192 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-28 03:04:36,927 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:04:36,927 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:04:36,927 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:04:36,927 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:04:36,928 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:04:36,928 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:36,928 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:04:36,928 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:04:36,928 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration3_Lasso [2019-11-28 03:04:36,928 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:04:36,929 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:04:36,933 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:04:36,940 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:04:36,942 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:04:36,944 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:04:36,949 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:04:37,119 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:04:37,122 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:04:37,124 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:04:37,126 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:04:37,128 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:04:37,131 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:04:37,133 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:04:37,135 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:04:37,137 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:04:37,139 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:04:37,141 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:04:37,143 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:04:37,145 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:04:37,147 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:04:37,148 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:04:37,150 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:04:37,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:04:37,156 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:04:37,158 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:04:37,160 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:04:37,162 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:04:37,164 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:04:37,166 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:04:37,168 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:04:37,171 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:04:37,173 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:04:37,175 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:04:37,181 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:04:37,183 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:04:37,186 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:04:37,652 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 30 [2019-11-28 03:04:37,745 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:04:37,745 INFO L489 LassoAnalysis]: Using template 'affine'. 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:04:37,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:04:37,752 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:37,753 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:37,753 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:37,753 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:37,753 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:37,753 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:37,754 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:37,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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:37,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:04:37,764 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:37,766 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:37,766 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:37,766 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:37,766 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:37,767 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:37,767 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:37,768 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:04:37,774 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:37,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:37,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:37,776 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:37,776 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:37,776 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:37,777 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:37,777 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:37,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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:37,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:37,799 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:37,799 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:37,800 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:37,800 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:37,800 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:37,800 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:37,800 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:37,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:37,807 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:37,809 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:37,809 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:37,809 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:37,810 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:37,812 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:37,813 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:37,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 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:04:37,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:37,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:37,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:37,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:37,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:37,841 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:37,841 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:37,849 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:04:37,866 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-11-28 03:04:37,866 INFO L444 ModelExtractionUtils]: 0 out of 10 variables were initially zero. Simplification set additionally 7 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:37,870 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-28 03:04:37,872 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:04:37,872 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:04:37,872 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_1 + 1 Supporting invariants [] [2019-11-28 03:04:37,877 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2019-11-28 03:04:37,883 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:04:37,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:37,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:37,928 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-28 03:04:37,929 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:37,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:37,947 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 03:04:37,948 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:37,993 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:37,994 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-28 03:04:37,995 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:38,023 INFO L588 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-28 03:04:38,024 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:38,024 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-28 03:04:38,039 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:04:38,040 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-28 03:04:38,040 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2019-11-28 03:04:38,130 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2019-11-28 03:04:38,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:04:38,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-28 03:04:38,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2019-11-28 03:04:38,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2019-11-28 03:04:38,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:38,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2019-11-28 03:04:38,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:38,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-28 03:04:38,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:38,136 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2019-11-28 03:04:38,140 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-28 03:04:38,143 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2019-11-28 03:04:38,144 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2019-11-28 03:04:38,144 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2019-11-28 03:04:38,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2019-11-28 03:04:38,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:04:38,145 INFO L688 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2019-11-28 03:04:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2019-11-28 03:04:38,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2019-11-28 03:04:38,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-11-28 03:04:38,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2019-11-28 03:04:38,155 INFO L711 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-11-28 03:04:38,155 INFO L591 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2019-11-28 03:04:38,155 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-28 03:04:38,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2019-11-28 03:04:38,158 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2019-11-28 03:04:38,158 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:38,158 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:38,159 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:38,159 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:38,160 INFO L794 eck$LassoCheckResult]: Stem: 508#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 507#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 485#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 487#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 552#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 527#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 550#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 549#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 496#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 548#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 556#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 555#recFINAL assume true; 538#recEXIT >#42#return; 535#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 533#recFINAL assume true; 526#recEXIT >#44#return; 481#L38-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 482#L38-3 [2019-11-28 03:04:38,160 INFO L796 eck$LassoCheckResult]: Loop: 482#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 517#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 534#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 532#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 513#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 525#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 531#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 514#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 525#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 531#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 512#recFINAL assume true; 515#recEXIT >#42#return; 524#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 530#recFINAL assume true; 523#recEXIT >#44#return; 521#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 482#L38-3 [2019-11-28 03:04:38,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:38,161 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2019-11-28 03:04:38,161 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:38,161 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539533927] [2019-11-28 03:04:38,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:38,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-28 03:04:38,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539533927] [2019-11-28 03:04:38,306 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1519073121] [2019-11-28 03:04:38,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 03:04:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:38,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 28 conjunts are in the unsatisfiable core [2019-11-28 03:04:38,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:38,398 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:38,398 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 46 [2019-11-28 03:04:38,400 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:38,426 INFO L588 ElimStorePlain]: treesize reduction 20, result has 60.8 percent of original size [2019-11-28 03:04:38,427 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:38,428 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:25, output treesize:9 [2019-11-28 03:04:38,495 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2019-11-28 03:04:38,496 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:38,500 INFO L588 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:38,500 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:38,501 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:26, output treesize:11 [2019-11-28 03:04:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 03:04:38,519 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 03:04:38,519 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2019-11-28 03:04:38,519 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505994815] [2019-11-28 03:04:38,520 INFO L799 eck$LassoCheckResult]: stem already infeasible [2019-11-28 03:04:38,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:38,520 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2019-11-28 03:04:38,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:38,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548440375] [2019-11-28 03:04:38,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:38,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:38,556 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:39,043 WARN L192 SmtUtils]: Spent 310.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [MP z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Exception during sending of exit command (exit): Broken pipe [2019-11-28 03:04:39,240 WARN L192 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 77 [2019-11-28 03:04:39,767 WARN L192 SmtUtils]: Spent 438.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 124 [2019-11-28 03:04:39,894 WARN L192 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-11-28 03:04:39,895 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 03:04:39,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-28 03:04:39,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2019-11-28 03:04:39,896 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 14 states. [2019-11-28 03:04:40,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 03:04:40,064 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2019-11-28 03:04:40,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-28 03:04:40,065 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2019-11-28 03:04:40,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:04:40,070 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2019-11-28 03:04:40,071 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-28 03:04:40,071 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-28 03:04:40,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2019-11-28 03:04:40,072 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-28 03:04:40,072 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2019-11-28 03:04:40,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2019-11-28 03:04:40,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2019-11-28 03:04:40,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-11-28 03:04:40,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2019-11-28 03:04:40,079 INFO L711 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-28 03:04:40,079 INFO L591 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2019-11-28 03:04:40,079 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-28 03:04:40,079 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2019-11-28 03:04:40,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-11-28 03:04:40,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-28 03:04:40,080 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-28 03:04:40,081 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 03:04:40,081 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-11-28 03:04:40,082 INFO L794 eck$LassoCheckResult]: Stem: 756#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; 755#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.allocOnHeap(4);main_~qq~0.base, main_~qq~0.offset := main_#t~malloc6.base, main_#t~malloc6.offset;call write~int(main_#t~nondet7, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~nondet7; 739#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 740#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 750#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 762#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 768#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 769#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 752#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 766#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 772#L9 assume #t~mem1 < 0;havoc #t~mem1;call #t~mem2 := read~int(~op.base, ~op.offset, 4);~r~0 := #t~mem2;havoc #t~mem2;#res := ~r~0; 771#recFINAL assume true; 765#recEXIT >#42#return; 764#L17-1 ~res~0 := #t~ret5;havoc #t~ret5;call ULTIMATE.dealloc(~ip~0.base, ~ip~0.offset);#res := ~res~0; 763#recFINAL assume true; 761#recEXIT >#44#return; 737#L38-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 738#L38-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~ite13;havoc main_#t~mem14; 741#L30-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 743#L30-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.allocOnHeap(4);main_~pp~0.base, main_~pp~0.offset := main_#t~malloc9.base, main_#t~malloc9.offset;call write~int(main_#t~nondet10, main_~pp~0.base, main_~pp~0.offset, 4);havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 749#L34 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 730#L38 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 729#recENTRY [2019-11-28 03:04:40,082 INFO L796 eck$LassoCheckResult]: Loop: 729#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 731#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.allocOnHeap(4);~ip~0.base, ~ip~0.offset := #t~malloc3.base, #t~malloc3.offset;call #t~mem4 := read~int(~op.base, ~op.offset, 4);call write~int(#t~mem4 - 1, ~ip~0.base, ~ip~0.offset, 4);havoc #t~mem4; 732#L17 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 729#recENTRY [2019-11-28 03:04:40,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:40,082 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2019-11-28 03:04:40,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:40,083 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106532875] [2019-11-28 03:04:40,083 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:40,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:40,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:40,133 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:40,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:40,134 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2019-11-28 03:04:40,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:40,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773672226] [2019-11-28 03:04:40,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:40,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:40,147 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:40,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:40,148 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2019-11-28 03:04:40,148 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 03:04:40,148 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147294383] [2019-11-28 03:04:40,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 03:04:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 03:04:40,241 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 03:04:40,364 WARN L192 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 61 [2019-11-28 03:04:40,897 WARN L192 SmtUtils]: Spent 248.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 90 [2019-11-28 03:04:42,475 WARN L192 SmtUtils]: Spent 1.32 s on a formula simplification. DAG size of input: 230 DAG size of output: 192 [2019-11-28 03:04:42,786 WARN L192 SmtUtils]: Spent 301.00 ms on a formula simplification that was a NOOP. DAG size: 115 [2019-11-28 03:04:43,145 WARN L192 SmtUtils]: Spent 339.00 ms on a formula simplification that was a NOOP. DAG size: 121 [2019-11-28 03:04:43,402 WARN L192 SmtUtils]: Spent 246.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-11-28 03:04:43,404 INFO L210 LassoAnalysis]: Preferences: [2019-11-28 03:04:43,404 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2019-11-28 03:04:43,404 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-28 03:04:43,405 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2019-11-28 03:04:43,405 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2019-11-28 03:04:43,405 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:43,405 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-28 03:04:43,405 INFO L132 ssoRankerPreferences]: Path of dumped script: [2019-11-28 03:04:43,405 INFO L133 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11D.i_Iteration5_Lasso [2019-11-28 03:04:43,406 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-28 03:04:43,406 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-28 03:04:43,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:04:43,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:04:43,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:04:43,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:04:43,439 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:04:43,441 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:04:43,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:04:43,447 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:04:43,449 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:04:43,451 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:04:43,453 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:04:43,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:04:43,457 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:04:43,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:04:43,461 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:04:43,463 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:04:43,465 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:04:43,467 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:04:43,645 WARN L192 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-28 03:04:43,793 WARN L192 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 48 [2019-11-28 03:04:43,793 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:04:43,798 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:04:43,800 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:04:43,802 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:04:43,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:04:43,805 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:04:43,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:04:43,809 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:04:43,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:04:43,813 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:04:43,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:04:43,817 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:04:43,819 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:04:43,822 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:04:43,823 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:04:43,824 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:04:43,825 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:04:44,636 WARN L192 SmtUtils]: Spent 473.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 44 [2019-11-28 03:04:44,748 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-28 03:04:44,749 INFO L489 LassoAnalysis]: Using template 'affine'. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,756 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,756 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,756 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,756 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,756 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,757 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,757 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,759 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,776 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,778 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,778 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,778 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,778 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,778 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,778 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,778 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,780 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,791 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,793 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,793 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,793 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,793 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,793 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,794 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,794 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,795 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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,804 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,804 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,804 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,804 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,804 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,805 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,805 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,806 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) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,813 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,813 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,813 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,813 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,813 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,813 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,813 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,821 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,823 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,823 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,823 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,823 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,825 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:44,825 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:44,830 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:04:44,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,839 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,839 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,839 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,839 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,839 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,840 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,840 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,848 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) [2019-11-28 03:04:44,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,861 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,861 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,863 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,864 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:04:44,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,873 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,873 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,874 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,874 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,874 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,874 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,874 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,875 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:04:44,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,882 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,882 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,882 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,882 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,884 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:44,884 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:44,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,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:04:44,898 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,898 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,899 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,899 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,899 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,899 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,899 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,902 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:44,909 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,909 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,909 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,909 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,909 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,910 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,910 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,912 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,918 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:44,919 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,920 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,920 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,920 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,920 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,920 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,920 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,922 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:04:44,928 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,929 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,929 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,930 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,930 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,930 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,930 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,930 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,931 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) [2019-11-28 03:04:44,949 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,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 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:04:44,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,962 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,962 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,962 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,962 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,962 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,964 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,964 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,967 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:04:44,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-28 03:04:44,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-28 03:04:44,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-28 03:04:44,976 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:44,981 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:44,982 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,982 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,982 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,982 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,983 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:44,983 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:44,986 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:04:44,992 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-28 03:04:44,994 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:44,994 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:44,994 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:44,994 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:44,996 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:44,996 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:45,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:45,007 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:45,009 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:45,009 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:45,009 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:45,009 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:45,011 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:45,011 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:45,015 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:04:45,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:45,030 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:45,030 INFO L203 nArgumentSynthesizer]: 16 stem disjuncts [2019-11-28 03:04:45,030 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-28 03:04:45,030 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:45,063 INFO L401 nArgumentSynthesizer]: We have 76 Motzkin's Theorem applications. [2019-11-28 03:04:45,064 INFO L402 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-28 03:04:45,112 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:04:45,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:45,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:45,119 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:45,119 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:45,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:45,127 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:45,127 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:45,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 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:04:45,145 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 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:04:45,146 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2019-11-28 03:04:45,147 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-28 03:04:45,147 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-28 03:04:45,147 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-28 03:04:45,151 INFO L401 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-28 03:04:45,151 INFO L402 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-28 03:04:45,163 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-28 03:04:45,185 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-28 03:04:45,186 INFO L444 ModelExtractionUtils]: 7 out of 16 variables were initially zero. Simplification set additionally 6 variables to zero. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-28 03:04:45,190 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... Waiting until toolchain timeout for monitored process 44 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-28 03:04:45,193 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-28 03:04:45,194 INFO L510 LassoAnalysis]: Proved termination. [2019-11-28 03:04:45,194 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) rec_#in~op.offset)_2 + 1 Supporting invariants [] [2019-11-28 03:04:45,207 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2019-11-28 03:04:45,209 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-28 03:04:45,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:45,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:45,279 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:04:45,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:45,307 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:45,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:45,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 03:04:45,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:45,373 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:45,374 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-28 03:04:45,375 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:45,410 INFO L588 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-28 03:04:45,411 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:45,411 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-28 03:04:45,427 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:04:45,428 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-28 03:04:45,428 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 03:04:45,507 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-11-28 03:04:45,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:04:45,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:04:45,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 03:04:45,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 03:04:45,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:45,510 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:04:45,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:45,569 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:04:45,572 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:45,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:45,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:45,621 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 03:04:45,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:45,664 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:45,664 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-28 03:04:45,665 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:45,715 INFO L588 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-28 03:04:45,716 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:45,716 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-28 03:04:45,730 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:04:45,732 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-28 03:04:45,732 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 03:04:45,804 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 55 states and 65 transitions. Complement of second has 14 states. [2019-11-28 03:04:45,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:04:45,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:04:45,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 11 transitions. [2019-11-28 03:04:45,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 03:04:45,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:45,806 INFO L639 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-28 03:04:45,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 03:04:45,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:45,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-28 03:04:45,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:45,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-28 03:04:45,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 03:04:45,903 INFO L255 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 17 conjunts are in the unsatisfiable core [2019-11-28 03:04:45,904 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 03:04:45,946 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-28 03:04:45,946 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 53 [2019-11-28 03:04:45,947 INFO L508 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-28 03:04:45,970 INFO L588 ElimStorePlain]: treesize reduction 20, result has 67.7 percent of original size [2019-11-28 03:04:45,971 INFO L508 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-28 03:04:45,971 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:36, output treesize:21 [2019-11-28 03:04:45,983 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:04:45,983 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2019-11-28 03:04:45,983 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 5 states. [2019-11-28 03:04:46,081 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 68 states and 78 transitions. Complement of second has 15 states. [2019-11-28 03:04:46,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-28 03:04:46,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-28 03:04:46,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-11-28 03:04:46,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 3 letters. [2019-11-28 03:04:46,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:46,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 25 letters. Loop has 3 letters. [2019-11-28 03:04:46,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:46,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 22 letters. Loop has 6 letters. [2019-11-28 03:04:46,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-28 03:04:46,087 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2019-11-28 03:04:46,089 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:04:46,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2019-11-28 03:04:46,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-28 03:04:46,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-28 03:04:46,090 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-28 03:04:46,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-28 03:04:46,090 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:04:46,090 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:04:46,090 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 03:04:46,090 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-28 03:04:46,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-28 03:04:46,091 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-28 03:04:46,091 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-28 03:04:46,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.11 03:04:46 BoogieIcfgContainer [2019-11-28 03:04:46,098 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-28 03:04:46,098 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 03:04:46,098 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 03:04:46,098 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 03:04:46,099 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:04:30" (3/4) ... [2019-11-28 03:04:46,102 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-28 03:04:46,103 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 03:04:46,104 INFO L168 Benchmark]: Toolchain (without parser) took 16897.64 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 388.5 MB). Free memory was 960.4 MB in the beginning and 1.3 GB in the end (delta: -355.8 MB). Peak memory consumption was 32.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:46,105 INFO L168 Benchmark]: CDTParser took 0.29 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:04:46,105 INFO L168 Benchmark]: CACSL2BoogieTranslator took 363.93 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:46,106 INFO L168 Benchmark]: Boogie Procedure Inliner took 108.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:46,107 INFO L168 Benchmark]: Boogie Preprocessor took 35.39 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:46,107 INFO L168 Benchmark]: RCFGBuilder took 353.86 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: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:46,108 INFO L168 Benchmark]: BuchiAutomizer took 16026.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -198.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. [2019-11-28 03:04:46,108 INFO L168 Benchmark]: Witness Printer took 4.93 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 03:04:46,112 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.29 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 363.93 ms. Allocated memory is still 1.0 GB. Free memory was 960.4 MB in the beginning and 949.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 108.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 148.4 MB). Free memory was 949.6 MB in the beginning and 1.1 GB in the end (delta: -195.3 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.39 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.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 353.86 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: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16026.01 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 240.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -198.1 MB). Peak memory consumption was 42.1 MB. Max. memory is 11.5 GB. * Witness Printer took 4.93 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (2 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[qq][qq] and consists of 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 6 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 13.7s. Construction of modules took 0.3s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 82 SDtfs, 62 SDslu, 150 SDs, 0 SdLazy, 243 SolverSat, 44 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital385 mio100 ax100 hnf100 lsp98 ukn39 mio100 lsp28 div100 bol100 ite100 ukn100 eq180 hnf90 smp98 dnf473 smp79 tf100 neg86 sie150 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 94ms VariablesStem: 5 VariablesLoop: 2 DisjunctsStem: 16 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 76 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...