./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer --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 18b42b65120149c30866fbc5b5479df029781f63 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 08:34:38,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 08:34:38,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 08:34:38,025 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 08:34:38,025 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 08:34:38,025 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 08:34:38,026 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 08:34:38,027 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 08:34:38,028 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 08:34:38,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 08:34:38,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 08:34:38,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 08:34:38,029 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 08:34:38,030 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 08:34:38,030 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 08:34:38,030 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 08:34:38,031 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 08:34:38,032 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 08:34:38,033 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 08:34:38,033 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 08:34:38,034 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 08:34:38,035 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 08:34:38,036 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 08:34:38,036 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 08:34:38,036 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 08:34:38,037 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 08:34:38,037 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 08:34:38,037 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 08:34:38,038 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 08:34:38,038 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 08:34:38,038 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 08:34:38,039 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 08:34:38,039 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 08:34:38,039 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 08:34:38,039 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 08:34:38,040 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 08:34:38,040 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 08:34:38,047 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 08:34:38,047 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 08:34:38,048 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 08:34:38,048 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 08:34:38,048 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 08:34:38,048 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 08:34:38,048 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 08:34:38,048 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 08:34:38,049 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 08:34:38,049 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 08:34:38,050 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 08:34:38,050 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 08:34:38,050 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 08:34:38,050 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 08:34:38,050 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 08:34:38,050 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 08:34:38,050 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 08:34:38,050 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 08:34:38,051 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 08:34:38,051 INFO L133 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer 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 -> 18b42b65120149c30866fbc5b5479df029781f63 [2018-12-08 08:34:38,067 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 08:34:38,073 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 08:34:38,075 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 08:34:38,076 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 08:34:38,077 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 08:34:38,077 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2018-12-08 08:34:38,114 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/data/b0359805d/464ac70950e94d1cadfc5c06bf0eb4f7/FLAG4a8f1ed33 [2018-12-08 08:34:38,466 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 08:34:38,466 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11B_true-termination.c.i [2018-12-08 08:34:38,470 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/data/b0359805d/464ac70950e94d1cadfc5c06bf0eb4f7/FLAG4a8f1ed33 [2018-12-08 08:34:38,478 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/data/b0359805d/464ac70950e94d1cadfc5c06bf0eb4f7 [2018-12-08 08:34:38,480 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 08:34:38,480 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 08:34:38,481 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 08:34:38,481 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 08:34:38,483 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 08:34:38,483 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,485 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@dd688bd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38, skipping insertion in model container [2018-12-08 08:34:38,485 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,489 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 08:34:38,497 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 08:34:38,578 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:34:38,584 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 08:34:38,593 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 08:34:38,602 INFO L195 MainTranslator]: Completed translation [2018-12-08 08:34:38,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38 WrapperNode [2018-12-08 08:34:38,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 08:34:38,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 08:34:38,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 08:34:38,603 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 08:34:38,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,612 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,622 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 08:34:38,623 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 08:34:38,623 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 08:34:38,623 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 08:34:38,656 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,665 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,666 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (1/1) ... [2018-12-08 08:34:38,668 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 08:34:38,668 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 08:34:38,668 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 08:34:38,668 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 08:34:38,669 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_7fe857cc-9500-4a63-ba76-58df450e93c6/bin-2019/uautomizer/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 [2018-12-08 08:34:38,702 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 08:34:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-12-08 08:34:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-12-08 08:34:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 08:34:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 08:34:38,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 08:34:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 08:34:38,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 08:34:38,811 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 08:34:38,812 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 08:34:38,812 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:34:38 BoogieIcfgContainer [2018-12-08 08:34:38,812 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 08:34:38,812 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 08:34:38,812 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 08:34:38,815 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 08:34:38,815 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:34:38,815 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 08:34:38" (1/3) ... [2018-12-08 08:34:38,816 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a509e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:34:38, skipping insertion in model container [2018-12-08 08:34:38,816 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:34:38,816 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 08:34:38" (2/3) ... [2018-12-08 08:34:38,817 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1a509e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 08:34:38, skipping insertion in model container [2018-12-08 08:34:38,817 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 08:34:38,817 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:34:38" (3/3) ... [2018-12-08 08:34:38,818 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11B_true-termination.c.i [2018-12-08 08:34:38,858 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 08:34:38,858 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 08:34:38,858 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 08:34:38,858 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 08:34:38,858 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 08:34:38,858 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 08:34:38,858 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 08:34:38,859 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 08:34:38,859 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 08:34:38,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-08 08:34:38,888 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 08:34:38,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:34:38,889 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:34:38,894 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 08:34:38,894 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:34:38,894 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 08:34:38,894 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2018-12-08 08:34:38,896 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2018-12-08 08:34:38,896 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:34:38,896 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:34:38,896 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 08:34:38,897 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:34:38,903 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#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~mem13, main_#t~ret11, main_#t~ite12, 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.alloc(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; 19#L28-3true [2018-12-08 08:34:38,904 INFO L796 eck$LassoCheckResult]: Loop: 19#L28-3true call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 4#L28-1true assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 12#L33true call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 3#recENTRYtrue ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 7#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 15#recFINALtrue assume true; 13#recEXITtrue >#39#return; 10#L33-1true assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 5#L33-3true call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret11;havoc main_#t~ite12; 19#L28-3true [2018-12-08 08:34:38,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:38,909 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-12-08 08:34:38,911 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:38,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:38,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:38,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:34:38,943 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:38,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:38,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:38,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:38,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1673639481, now seen corresponding path program 1 times [2018-12-08 08:34:38,994 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:38,994 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:38,995 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:34:38,995 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:39,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:39,037 INFO L82 PathProgramCache]: Analyzing trace with hash -508919995, now seen corresponding path program 1 times [2018-12-08 08:34:39,037 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:39,037 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:39,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:39,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:34:39,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:39,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:39,355 WARN L180 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 90 [2018-12-08 08:34:39,442 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:34:39,443 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:34:39,443 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:34:39,443 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:34:39,443 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:34:39,443 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:34:39,443 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:34:39,443 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:34:39,443 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration1_Lasso [2018-12-08 08:34:39,443 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:34:39,443 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:34:39,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:39,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:39,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:39,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:39,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:39,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:39,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:39,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:39,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:39,763 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:34:39,766 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:34:39,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:39,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:39,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:39,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:39,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:39,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:39,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:39,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:39,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:39,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:39,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:39,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:39,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:39,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:39,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:39,774 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:39,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:39,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:39,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:39,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:39,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:39,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:39,787 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:39,787 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:39,794 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:34:39,800 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 08:34:39,800 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 08:34:39,801 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:34:39,802 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:34:39,802 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:34:39,803 INFO L520 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 [] [2018-12-08 08:34:39,809 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-12-08 08:34:39,813 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 08:34:39,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:39,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:39,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:34:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:39,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:34:39,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:34:39,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:34:39,895 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-12-08 08:34:39,895 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 08:34:39,904 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 22 treesize of output 16 [2018-12-08 08:34:39,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2018-12-08 08:34:39,906 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 08:34:39,909 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:34:39,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 08:34:39,914 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:40, output treesize:7 [2018-12-08 08:34:39,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:34:39,947 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 5 loop predicates [2018-12-08 08:34:39,948 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 6 states. [2018-12-08 08:34:40,036 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 6 states. Result 65 states and 78 transitions. Complement of second has 18 states. [2018-12-08 08:34:40,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-12-08 08:34:40,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-12-08 08:34:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 24 transitions. [2018-12-08 08:34:40,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 9 letters. [2018-12-08 08:34:40,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:40,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 11 letters. Loop has 9 letters. [2018-12-08 08:34:40,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:40,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 24 transitions. Stem has 2 letters. Loop has 18 letters. [2018-12-08 08:34:40,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:40,042 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 78 transitions. [2018-12-08 08:34:40,044 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-08 08:34:40,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 47 states and 58 transitions. [2018-12-08 08:34:40,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-08 08:34:40,049 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-08 08:34:40,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 58 transitions. [2018-12-08 08:34:40,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:34:40,049 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 58 transitions. [2018-12-08 08:34:40,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 58 transitions. [2018-12-08 08:34:40,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-12-08 08:34:40,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-12-08 08:34:40,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2018-12-08 08:34:40,068 INFO L728 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-12-08 08:34:40,068 INFO L608 BuchiCegarLoop]: Abstraction has 46 states and 57 transitions. [2018-12-08 08:34:40,068 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 08:34:40,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 46 states and 57 transitions. [2018-12-08 08:34:40,069 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 11 [2018-12-08 08:34:40,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:34:40,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:34:40,069 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:34:40,069 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 08:34:40,070 INFO L794 eck$LassoCheckResult]: Stem: 197#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 192#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~mem13, main_#t~ret11, main_#t~ite12, 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.alloc(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; 193#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 208#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 188#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 200#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 187#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(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;call ULTIMATE.dealloc(~op.base, ~op.offset); 175#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2018-12-08 08:34:40,070 INFO L796 eck$LassoCheckResult]: Loop: 173#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 176#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(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;call ULTIMATE.dealloc(~op.base, ~op.offset); 174#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 173#recENTRY [2018-12-08 08:34:40,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:40,070 INFO L82 PathProgramCache]: Analyzing trace with hash -15731550, now seen corresponding path program 1 times [2018-12-08 08:34:40,070 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:40,070 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:40,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:40,071 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:34:40,071 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:40,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:40,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:40,091 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 1 times [2018-12-08 08:34:40,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:40,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:40,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:40,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:34:40,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:40,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:40,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:40,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:40,100 INFO L82 PathProgramCache]: Analyzing trace with hash -507170626, now seen corresponding path program 2 times [2018-12-08 08:34:40,100 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:40,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:40,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:40,101 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:34:40,101 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:40,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:40,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:40,511 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 82 [2018-12-08 08:34:40,797 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 103 [2018-12-08 08:34:40,863 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:34:40,863 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:34:40,863 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:34:40,863 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:34:40,863 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:34:40,863 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:34:40,863 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:34:40,863 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:34:40,863 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration2_Lasso [2018-12-08 08:34:40,863 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:34:40,863 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:34:40,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,876 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,975 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:40,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:41,165 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:34:41,165 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:34:41,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:41,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:41,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:41,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:41,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,168 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:41,168 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:41,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:41,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,169 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,169 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:41,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:41,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,170 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:41,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:41,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:41,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:41,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:41,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:41,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:41,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,173 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:41,173 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:41,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:41,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,174 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,174 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,174 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:41,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:41,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,175 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:41,176 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:41,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:41,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,178 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:41,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:41,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:41,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,180 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:41,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:41,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,184 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:41,184 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:41,190 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,191 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,191 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,191 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,192 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:41,192 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:41,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,195 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,195 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:34:41,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,195 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,196 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:34:41,196 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:41,198 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,199 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,200 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:41,200 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:41,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,202 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:34:41,202 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 08:34:41,202 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,205 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 08:34:41,205 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 08:34:41,214 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,215 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,216 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:41,217 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:41,219 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,221 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:41,221 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:41,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:41,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:41,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:41,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:41,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:41,229 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:41,230 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:41,230 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:41,246 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:34:41,250 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 08:34:41,250 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 08:34:41,251 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:34:41,251 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:34:41,252 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:34:41,252 INFO L520 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 [] [2018-12-08 08:34:41,255 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-08 08:34:41,256 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 08:34:41,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:41,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:41,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:34:41,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:41,295 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:34:41,321 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-12-08 08:34:41,324 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-08 08:34:41,325 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:34:41,349 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:34:41,358 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-12-08 08:34:41,359 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 08:34:41,372 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 08:34:41,384 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 08:34:41,384 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-08 08:34:41,404 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:34:41,404 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 [2018-12-08 08:34:41,404 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-12-08 08:34:41,447 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 46 states and 57 transitions. cyclomatic complexity: 16. Second operand 4 states. Result 128 states and 165 transitions. Complement of second has 17 states. [2018-12-08 08:34:41,447 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 [2018-12-08 08:34:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 08:34:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-08 08:34:41,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-08 08:34:41,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:41,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-08 08:34:41,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:41,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-08 08:34:41,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:41,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 128 states and 165 transitions. [2018-12-08 08:34:41,451 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-08 08:34:41,454 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 128 states to 110 states and 147 transitions. [2018-12-08 08:34:41,454 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2018-12-08 08:34:41,454 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 61 [2018-12-08 08:34:41,454 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 147 transitions. [2018-12-08 08:34:41,454 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:34:41,454 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 147 transitions. [2018-12-08 08:34:41,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 147 transitions. [2018-12-08 08:34:41,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2018-12-08 08:34:41,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-12-08 08:34:41,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 135 transitions. [2018-12-08 08:34:41,461 INFO L728 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2018-12-08 08:34:41,461 INFO L608 BuchiCegarLoop]: Abstraction has 104 states and 135 transitions. [2018-12-08 08:34:41,461 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 08:34:41,461 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 104 states and 135 transitions. [2018-12-08 08:34:41,462 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 16 [2018-12-08 08:34:41,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:34:41,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:34:41,463 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:34:41,463 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:34:41,463 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 442#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~mem13, main_#t~ret11, main_#t~ite12, 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.alloc(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; 443#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 470#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 494#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 504#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 516#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 515#recFINAL assume true; 493#recEXIT >#39#return; 453#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 438#L33-3 [2018-12-08 08:34:41,463 INFO L796 eck$LassoCheckResult]: Loop: 438#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret11;havoc main_#t~ite12; 439#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 485#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 476#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 497#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 489#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 490#recFINAL assume true; 475#recEXIT >#39#return; 472#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 438#L33-3 [2018-12-08 08:34:41,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:41,463 INFO L82 PathProgramCache]: Analyzing trace with hash 2061793209, now seen corresponding path program 1 times [2018-12-08 08:34:41,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:41,463 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:41,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:41,464 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:34:41,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:41,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:41,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:34:41,494 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:34:41,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 08:34:41,495 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:34:41,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:41,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 2 times [2018-12-08 08:34:41,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:41,496 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:41,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:41,496 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:34:41,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:41,729 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 95 [2018-12-08 08:34:41,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 08:34:41,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 08:34:41,772 INFO L87 Difference]: Start difference. First operand 104 states and 135 transitions. cyclomatic complexity: 41 Second operand 5 states. [2018-12-08 08:34:41,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:34:41,792 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2018-12-08 08:34:41,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 08:34:41,793 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 98 states and 123 transitions. [2018-12-08 08:34:41,795 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 13 [2018-12-08 08:34:41,797 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 98 states to 92 states and 117 transitions. [2018-12-08 08:34:41,797 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-12-08 08:34:41,797 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-12-08 08:34:41,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 92 states and 117 transitions. [2018-12-08 08:34:41,797 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:34:41,797 INFO L705 BuchiCegarLoop]: Abstraction has 92 states and 117 transitions. [2018-12-08 08:34:41,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states and 117 transitions. [2018-12-08 08:34:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 90. [2018-12-08 08:34:41,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-12-08 08:34:41,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 115 transitions. [2018-12-08 08:34:41,804 INFO L728 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-12-08 08:34:41,804 INFO L608 BuchiCegarLoop]: Abstraction has 90 states and 115 transitions. [2018-12-08 08:34:41,804 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 08:34:41,804 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 90 states and 115 transitions. [2018-12-08 08:34:41,805 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-12-08 08:34:41,805 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:34:41,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:34:41,807 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:34:41,807 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:34:41,807 INFO L794 eck$LassoCheckResult]: Stem: 660#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 651#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~mem13, main_#t~ret11, main_#t~ite12, 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.alloc(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; 652#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 678#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 637#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 636#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 638#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(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;call ULTIMATE.dealloc(~op.base, ~op.offset); 653#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 700#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 706#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 675#recFINAL assume true; 676#recEXIT >#37#return; 697#L19-1 #res := #t~ret5;havoc #t~ret5; 695#recFINAL assume true; 694#recEXIT >#39#return; 661#L33-1 assume !(main_#t~ret11 <= -1);main_#t~ite12 := 1; 647#L33-3 [2018-12-08 08:34:41,807 INFO L796 eck$LassoCheckResult]: Loop: 647#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret11;havoc main_#t~ite12; 648#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 691#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 686#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 689#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 692#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 693#recFINAL assume true; 696#recEXIT >#39#return; 680#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 647#L33-3 [2018-12-08 08:34:41,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash 970657719, now seen corresponding path program 1 times [2018-12-08 08:34:41,808 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:41,808 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:41,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:41,808 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:34:41,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-12-08 08:34:41,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 08:34:41,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 08:34:41,851 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-08 08:34:41,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:41,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1530037457, now seen corresponding path program 3 times [2018-12-08 08:34:41,851 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:41,851 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:41,852 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:34:41,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:41,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:41,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:42,057 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 89 [2018-12-08 08:34:42,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-08 08:34:42,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-12-08 08:34:42,085 INFO L87 Difference]: Start difference. First operand 90 states and 115 transitions. cyclomatic complexity: 33 Second operand 6 states. [2018-12-08 08:34:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 08:34:42,103 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2018-12-08 08:34:42,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 08:34:42,103 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 96 transitions. [2018-12-08 08:34:42,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:34:42,105 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 52 states and 63 transitions. [2018-12-08 08:34:42,105 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-08 08:34:42,105 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-08 08:34:42,105 INFO L73 IsDeterministic]: Start isDeterministic. Operand 52 states and 63 transitions. [2018-12-08 08:34:42,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 08:34:42,106 INFO L705 BuchiCegarLoop]: Abstraction has 52 states and 63 transitions. [2018-12-08 08:34:42,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states and 63 transitions. [2018-12-08 08:34:42,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2018-12-08 08:34:42,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-08 08:34:42,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2018-12-08 08:34:42,108 INFO L728 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-12-08 08:34:42,108 INFO L608 BuchiCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-12-08 08:34:42,108 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 08:34:42,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 49 states and 60 transitions. [2018-12-08 08:34:42,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-08 08:34:42,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 08:34:42,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 08:34:42,109 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 08:34:42,109 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-08 08:34:42,109 INFO L794 eck$LassoCheckResult]: Stem: 831#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 825#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~mem13, main_#t~ret11, main_#t~ite12, 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.alloc(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; 826#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 820#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 821#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 845#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 852#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(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;call ULTIMATE.dealloc(~op.base, ~op.offset); 834#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 854#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 858#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;call ULTIMATE.dealloc(~op.base, ~op.offset);#res := ~r~0; 856#recFINAL assume true; 837#recEXIT >#37#return; 838#L19-1 #res := #t~ret5;havoc #t~ret5; 850#recFINAL assume true; 846#recEXIT >#39#return; 830#L33-1 assume main_#t~ret11 <= -1;main_#t~ite12 := -1; 822#L33-3 call write~int(main_#t~mem13 + main_#t~ite12, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~mem13;havoc main_#t~ret11;havoc main_#t~ite12; 823#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 819#L28-1 assume !!(main_#t~mem8 > 1);havoc main_#t~mem8;call main_#t~malloc9.base, main_#t~malloc9.offset := #Ultimate.alloc(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~mem13 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 814#L33 call main_#t~ret11 := rec(main_~pp~0.base, main_~pp~0.offset);< 811#recENTRY [2018-12-08 08:34:42,109 INFO L796 eck$LassoCheckResult]: Loop: 811#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 813#L9 assume !(#t~mem1 < 0);havoc #t~mem1;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(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;call ULTIMATE.dealloc(~op.base, ~op.offset); 812#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 811#recENTRY [2018-12-08 08:34:42,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:42,109 INFO L82 PathProgramCache]: Analyzing trace with hash -1312873862, now seen corresponding path program 1 times [2018-12-08 08:34:42,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:42,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:42,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:42,110 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:34:42,110 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:42,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:42,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:42,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:42,127 INFO L82 PathProgramCache]: Analyzing trace with hash 29951, now seen corresponding path program 2 times [2018-12-08 08:34:42,127 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:42,127 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:42,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:42,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 08:34:42,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:42,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:42,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1853025306, now seen corresponding path program 2 times [2018-12-08 08:34:42,132 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 08:34:42,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 08:34:42,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:42,133 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 08:34:42,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 08:34:42,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:42,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 08:34:42,464 WARN L180 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 85 [2018-12-08 08:34:43,377 WARN L180 SmtUtils]: Spent 814.00 ms on a formula simplification. DAG size of input: 210 DAG size of output: 178 [2018-12-08 08:34:43,525 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-12-08 08:34:43,798 WARN L180 SmtUtils]: Spent 262.00 ms on a formula simplification that was a NOOP. DAG size: 116 [2018-12-08 08:34:43,907 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 94 [2018-12-08 08:34:43,909 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 08:34:43,909 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 08:34:43,909 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 08:34:43,909 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 08:34:43,909 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 08:34:43,909 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 08:34:43,909 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 08:34:43,909 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 08:34:43,909 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11B_true-termination.c.i_Iteration5_Lasso [2018-12-08 08:34:43,909 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 08:34:43,909 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 08:34:43,912 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,920 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:43,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,012 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,013 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,014 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,015 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,018 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 08:34:44,157 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 08:34:44,157 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 08:34:44,157 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:44,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,158 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:44,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:44,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:44,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,159 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,159 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:44,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:44,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:44,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,160 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,160 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:44,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:44,161 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:44,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,161 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,161 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:44,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:44,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,162 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,163 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:44,163 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:44,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,164 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,164 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:44,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:44,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:44,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,165 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:44,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:44,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:44,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,166 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:44,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:44,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,167 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,167 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:44,167 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,167 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,167 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,167 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:44,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:44,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,168 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,168 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:44,168 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,169 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,170 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:44,170 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,170 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,170 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,170 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:44,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:44,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 08:34:44,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,171 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,171 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 08:34:44,171 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 08:34:44,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,171 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,172 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,172 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,172 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,172 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:44,172 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,173 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,173 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,174 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:44,174 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,178 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:44,178 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,180 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,180 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,181 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:44,181 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,182 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:34:44,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,182 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,182 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:34:44,182 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,184 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:34:44,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,184 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,184 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:34:44,185 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,186 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,186 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:34:44,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,186 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,186 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 08:34:44,186 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,187 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,188 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,188 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 08:34:44,188 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 08:34:44,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,189 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 08:34:44,189 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 08:34:44,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,193 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,193 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,194 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:44,194 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 08:34:44,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 08:34:44,197 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 08:34:44,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 08:34:44,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 08:34:44,197 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 08:34:44,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 08:34:44,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 08:34:44,200 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 08:34:44,202 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 08:34:44,202 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 08:34:44,202 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 08:34:44,202 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 08:34:44,202 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 08:34:44,202 INFO L520 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 [] [2018-12-08 08:34:44,206 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-08 08:34:44,207 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 08:34:44,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:44,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:44,242 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:34:44,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:44,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:34:44,283 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-12-08 08:34:44,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-08 08:34:44,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:34:44,304 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:34:44,310 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-12-08 08:34:44,311 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 08:34:44,326 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 08:34:44,334 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 08:34:44,335 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-08 08:34:44,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:34:44,349 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 [2018-12-08 08:34:44,349 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-08 08:34:44,390 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2018-12-08 08:34:44,391 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 [2018-12-08 08:34:44,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 08:34:44,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-08 08:34:44,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-08 08:34:44,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:44,392 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 08:34:44,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:44,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:44,419 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:34:44,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:44,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:34:44,470 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-12-08 08:34:44,473 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-08 08:34:44,473 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:34:44,493 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:34:44,497 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-12-08 08:34:44,498 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 08:34:44,512 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 08:34:44,521 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 08:34:44,521 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-08 08:34:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:34:44,535 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 [2018-12-08 08:34:44,535 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-08 08:34:44,570 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 78 states and 96 transitions. Complement of second has 16 states. [2018-12-08 08:34:44,570 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 [2018-12-08 08:34:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 08:34:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 10 transitions. [2018-12-08 08:34:44,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 10 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-08 08:34:44,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:44,571 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 08:34:44,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 08:34:44,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:44,596 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:34:44,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 08:34:44,614 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 08:34:44,632 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 44 [2018-12-08 08:34:44,635 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 36 [2018-12-08 08:34:44,635 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 08:34:44,659 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 08:34:44,663 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 30 treesize of output 40 [2018-12-08 08:34:44,664 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 08:34:44,674 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 08:34:44,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 08:34:44,684 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-12-08 08:34:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 08:34:44,699 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 [2018-12-08 08:34:44,699 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16 Second operand 5 states. [2018-12-08 08:34:44,754 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 49 states and 60 transitions. cyclomatic complexity: 16. Second operand 5 states. Result 76 states and 88 transitions. Complement of second has 17 states. [2018-12-08 08:34:44,755 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 [2018-12-08 08:34:44,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 08:34:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-12-08 08:34:44,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 3 letters. [2018-12-08 08:34:44,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:44,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 23 letters. Loop has 3 letters. [2018-12-08 08:34:44,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:44,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2018-12-08 08:34:44,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 08:34:44,756 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 76 states and 88 transitions. [2018-12-08 08:34:44,757 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:34:44,758 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 76 states to 0 states and 0 transitions. [2018-12-08 08:34:44,758 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 08:34:44,758 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 08:34:44,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 08:34:44,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 08:34:44,758 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:34:44,758 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:34:44,758 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 08:34:44,758 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 08:34:44,758 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 08:34:44,758 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 08:34:44,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 08:34:44,762 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 08:34:44 BoogieIcfgContainer [2018-12-08 08:34:44,762 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 08:34:44,762 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 08:34:44,762 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 08:34:44,763 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 08:34:44,763 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 08:34:38" (3/4) ... [2018-12-08 08:34:44,765 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 08:34:44,765 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 08:34:44,766 INFO L168 Benchmark]: Toolchain (without parser) took 6285.74 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 194.5 MB). Free memory was 957.1 MB in the beginning and 890.8 MB in the end (delta: 66.3 MB). Peak memory consumption was 260.8 MB. Max. memory is 11.5 GB. [2018-12-08 08:34:44,766 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:34:44,767 INFO L168 Benchmark]: CACSL2BoogieTranslator took 121.54 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:34:44,767 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.96 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:34:44,767 INFO L168 Benchmark]: Boogie Preprocessor took 45.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-12-08 08:34:44,768 INFO L168 Benchmark]: RCFGBuilder took 143.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-08 08:34:44,768 INFO L168 Benchmark]: BuchiAutomizer took 5949.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 890.8 MB in the end (delta: 203.4 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. [2018-12-08 08:34:44,768 INFO L168 Benchmark]: Witness Printer took 2.88 ms. Allocated memory is still 1.2 GB. Free memory is still 890.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 08:34:44,771 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 121.54 ms. Allocated memory is still 1.0 GB. Free memory was 957.1 MB in the beginning and 946.3 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 19.96 ms. Allocated memory is still 1.0 GB. Free memory is still 946.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 45.08 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 114.3 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -162.2 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 143.96 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5949.78 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 80.2 MB). Free memory was 1.1 GB in the beginning and 890.8 MB in the end (delta: 203.4 MB). Peak memory consumption was 283.7 MB. Max. memory is 11.5 GB. * Witness Printer took 2.88 ms. Allocated memory is still 1.2 GB. Free memory is still 890.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 9 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 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.9s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 4.7s. Construction of modules took 0.1s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 4. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 12 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 104 states and ocurred in iteration 2. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 82 SDtfs, 59 SDslu, 116 SDs, 0 SdLazy, 173 SolverSat, 37 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital350 mio100 ax100 hnf100 lsp97 ukn42 mio100 lsp29 div100 bol100 ite100 ukn100 eq186 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 12ms VariablesStem: 1 VariablesLoop: 1 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...