./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/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 2e31c843d33c80f978b3ed5615692b93565f0ae0 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 15:51:40,058 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 15:51:40,059 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 15:51:40,065 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 15:51:40,065 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 15:51:40,066 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 15:51:40,067 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 15:51:40,068 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 15:51:40,069 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 15:51:40,069 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 15:51:40,070 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 15:51:40,070 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 15:51:40,071 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 15:51:40,072 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 15:51:40,072 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 15:51:40,073 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 15:51:40,073 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 15:51:40,074 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 15:51:40,076 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 15:51:40,076 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 15:51:40,077 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 15:51:40,078 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 15:51:40,080 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 15:51:40,080 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 15:51:40,080 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 15:51:40,081 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 15:51:40,081 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 15:51:40,082 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 15:51:40,082 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 15:51:40,083 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 15:51:40,083 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 15:51:40,083 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 15:51:40,083 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 15:51:40,083 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 15:51:40,084 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 15:51:40,084 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 15:51:40,084 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 15:51:40,093 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 15:51:40,093 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 15:51:40,094 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 15:51:40,094 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 15:51:40,095 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 15:51:40,095 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 15:51:40,095 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 15:51:40,095 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 15:51:40,095 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 15:51:40,095 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 15:51:40,095 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 15:51:40,095 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 15:51:40,096 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 15:51:40,096 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 15:51:40,096 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 15:51:40,096 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 15:51:40,096 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 15:51:40,096 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 15:51:40,096 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 15:51:40,096 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 15:51:40,098 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 15:51:40,098 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 15:51:40,098 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 15:51:40,099 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 15:51:40,099 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 15:51:40,099 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 15:51:40,099 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 15:51:40,099 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 15:51:40,100 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 15:51:40,100 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_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/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 -> 2e31c843d33c80f978b3ed5615692b93565f0ae0 [2018-11-23 15:51:40,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 15:51:40,134 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 15:51:40,137 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 15:51:40,138 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 15:51:40,138 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 15:51:40,139 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i [2018-11-23 15:51:40,176 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/data/c301fa5e9/0b3946003cb749e7a6c45f3f34e53bb5/FLAG991a228e7 [2018-11-23 15:51:40,578 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 15:51:40,579 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex11_true-termination.c.i [2018-11-23 15:51:40,583 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/data/c301fa5e9/0b3946003cb749e7a6c45f3f34e53bb5/FLAG991a228e7 [2018-11-23 15:51:40,593 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/data/c301fa5e9/0b3946003cb749e7a6c45f3f34e53bb5 [2018-11-23 15:51:40,596 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 15:51:40,597 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 15:51:40,597 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 15:51:40,597 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 15:51:40,599 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 15:51:40,600 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,602 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39f9bc4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40, skipping insertion in model container [2018-11-23 15:51:40,602 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,608 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 15:51:40,621 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 15:51:40,728 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:51:40,735 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 15:51:40,745 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 15:51:40,754 INFO L195 MainTranslator]: Completed translation [2018-11-23 15:51:40,754 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40 WrapperNode [2018-11-23 15:51:40,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 15:51:40,755 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 15:51:40,755 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 15:51:40,755 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 15:51:40,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,767 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 15:51:40,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 15:51:40,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 15:51:40,778 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 15:51:40,818 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,818 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,819 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,821 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,824 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (1/1) ... [2018-11-23 15:51:40,826 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 15:51:40,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 15:51:40,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 15:51:40,827 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 15:51:40,827 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/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-11-23 15:51:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 15:51:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure rec [2018-11-23 15:51:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure rec [2018-11-23 15:51:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 15:51:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 15:51:40,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 15:51:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 15:51:40,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 15:51:41,012 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 15:51:41,012 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-23 15:51:41,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:41 BoogieIcfgContainer [2018-11-23 15:51:41,012 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 15:51:41,012 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 15:51:41,013 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 15:51:41,015 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 15:51:41,015 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:51:41,015 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 03:51:40" (1/3) ... [2018-11-23 15:51:41,016 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1052450c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:51:41, skipping insertion in model container [2018-11-23 15:51:41,016 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:51:41,016 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 03:51:40" (2/3) ... [2018-11-23 15:51:41,016 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1052450c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 03:51:41, skipping insertion in model container [2018-11-23 15:51:41,017 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 15:51:41,017 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:41" (3/3) ... [2018-11-23 15:51:41,018 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex11_true-termination.c.i [2018-11-23 15:51:41,051 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 15:51:41,051 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 15:51:41,052 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 15:51:41,052 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 15:51:41,052 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 15:51:41,052 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 15:51:41,052 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 15:51:41,052 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 15:51:41,052 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 15:51:41,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 15:51:41,081 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 15:51:41,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:41,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:41,086 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:51:41,086 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:41,087 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 15:51:41,087 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states. [2018-11-23 15:51:41,088 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 15:51:41,088 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:41,088 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:41,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:51:41,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:41,094 INFO L794 eck$LassoCheckResult]: Stem: 8#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5#L-1true havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.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-11-23 15:51:41,094 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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 9#L32true assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 20#L36true call main_#t~ret12 := 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); 6#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; 14#recFINALtrue assume true; 12#recEXITtrue >#44#return; 18#L36-1true assume -1 == main_#t~ret12;main_#t~ite13 := -1; 11#L36-3true call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 19#L28-3true [2018-11-23 15:51:41,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:41,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 1 times [2018-11-23 15:51:41,099 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:41,100 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:41,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:41,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:41,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:41,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:41,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2107477180, now seen corresponding path program 1 times [2018-11-23 15:51:41,179 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:41,179 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:41,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:41,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:41,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:41,302 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 15:51:41,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 15:51:41,306 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-23 15:51:41,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 15:51:41,316 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-23 15:51:41,317 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 7 states. [2018-11-23 15:51:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:41,405 INFO L93 Difference]: Finished difference Result 20 states and 24 transitions. [2018-11-23 15:51:41,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 15:51:41,407 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 24 transitions. [2018-11-23 15:51:41,409 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 15:51:41,413 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 16 states and 19 transitions. [2018-11-23 15:51:41,414 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-23 15:51:41,414 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-23 15:51:41,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 19 transitions. [2018-11-23 15:51:41,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:51:41,416 INFO L705 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 15:51:41,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 19 transitions. [2018-11-23 15:51:41,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 15:51:41,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 15:51:41,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 19 transitions. [2018-11-23 15:51:41,435 INFO L728 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 15:51:41,435 INFO L608 BuchiCegarLoop]: Abstraction has 16 states and 19 transitions. [2018-11-23 15:51:41,435 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 15:51:41,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 19 transitions. [2018-11-23 15:51:41,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 9 [2018-11-23 15:51:41,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:41,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:41,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 15:51:41,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:41,437 INFO L794 eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 57#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.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; 58#L28-3 [2018-11-23 15:51:41,437 INFO L796 eck$LassoCheckResult]: Loop: 58#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 55#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 56#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 52#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#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); 53#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 51#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 54#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; 59#recFINAL assume true; 64#recEXIT >#42#return; 61#L19-1 #res := #t~ret5;havoc #t~ret5; 62#recFINAL assume true; 66#recEXIT >#44#return; 65#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 63#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 58#L28-3 [2018-11-23 15:51:41,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:41,438 INFO L82 PathProgramCache]: Analyzing trace with hash 1219, now seen corresponding path program 2 times [2018-11-23 15:51:41,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:41,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:41,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:41,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:41,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:41,449 INFO L82 PathProgramCache]: Analyzing trace with hash 290320444, now seen corresponding path program 1 times [2018-11-23 15:51:41,449 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:41,449 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:41,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:41,450 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:51:41,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:41,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:41,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:41,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:41,510 INFO L82 PathProgramCache]: Analyzing trace with hash -645910274, now seen corresponding path program 1 times [2018-11-23 15:51:41,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:41,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:41,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:41,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:41,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:41,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:41,900 WARN L180 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 90 [2018-11-23 15:51:42,433 WARN L180 SmtUtils]: Spent 330.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 120 [2018-11-23 15:51:42,593 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:51:42,593 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:51:42,593 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:51:42,593 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:51:42,594 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:51:42,594 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:51:42,594 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:51:42,594 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:51:42,594 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration2_Lasso [2018-11-23 15:51:42,594 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:51:42,595 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:51:42,608 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,800 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 63 [2018-11-23 15:51:42,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:42,964 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:51:42,967 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:51:42,969 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-11-23 15:51:42,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:42,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:42,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:42,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:42,971 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:42,972 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:42,972 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:42,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:42,974 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-11-23 15:51:42,975 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:42,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:42,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:42,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:42,978 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:42,978 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:42,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:42,980 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-11-23 15:51:42,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:42,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:42,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:42,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:42,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:42,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:42,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:42,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:42,982 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-11-23 15:51:42,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:42,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:42,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:42,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:42,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:42,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:42,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:42,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:42,984 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-11-23 15:51:42,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:42,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:42,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:42,985 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:42,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:42,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:42,995 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:42,996 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-11-23 15:51:42,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:42,996 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:42,996 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:42,996 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:42,998 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:42,998 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:43,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:43,006 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-11-23 15:51:43,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:43,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:43,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:43,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:43,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:43,007 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:43,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:43,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:43,008 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-11-23 15:51:43,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:43,009 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:43,009 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:43,009 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:43,011 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:43,011 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:43,020 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:51:43,028 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:51:43,028 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 15:51:43,030 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:51:43,031 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:51:43,031 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:51:43,032 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-11-23 15:51:43,049 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 15:51:43,054 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:51:43,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:43,083 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:43,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:43,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:43,155 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:43,156 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:43,161 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-11-23 15:51:43,162 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:43,177 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-23 15:51:43,181 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 8 treesize of output 7 [2018-11-23 15:51:43,182 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:43,193 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:43,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:43,199 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:36, output treesize:15 [2018-11-23 15:51:43,212 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 16 [2018-11-23 15:51:43,215 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-11-23 15:51:43,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:43,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:43,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:43,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:7 [2018-11-23 15:51:43,265 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-11-23 15:51:43,268 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 6 loop predicates [2018-11-23 15:51:43,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5 Second operand 7 states. [2018-11-23 15:51:43,353 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 19 transitions. cyclomatic complexity: 5. Second operand 7 states. Result 62 states and 73 transitions. Complement of second has 17 states. [2018-11-23 15:51:43,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 1 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-23 15:51:43,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 15:51:43,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 17 transitions. [2018-11-23 15:51:43,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 16 letters. [2018-11-23 15:51:43,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:43,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 18 letters. Loop has 16 letters. [2018-11-23 15:51:43,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:43,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 17 transitions. Stem has 2 letters. Loop has 32 letters. [2018-11-23 15:51:43,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:43,360 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 62 states and 73 transitions. [2018-11-23 15:51:43,362 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 15:51:43,364 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 62 states to 56 states and 67 transitions. [2018-11-23 15:51:43,364 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-23 15:51:43,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-23 15:51:43,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2018-11-23 15:51:43,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:51:43,365 INFO L705 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2018-11-23 15:51:43,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2018-11-23 15:51:43,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 51. [2018-11-23 15:51:43,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 15:51:43,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 60 transitions. [2018-11-23 15:51:43,370 INFO L728 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-23 15:51:43,370 INFO L608 BuchiCegarLoop]: Abstraction has 51 states and 60 transitions. [2018-11-23 15:51:43,370 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 15:51:43,370 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 51 states and 60 transitions. [2018-11-23 15:51:43,371 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 15:51:43,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:43,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:43,372 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:43,372 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:51:43,372 INFO L794 eck$LassoCheckResult]: Stem: 255#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 249#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.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; 250#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 245#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 246#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 256#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 274#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 285#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); 240#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-23 15:51:43,372 INFO L796 eck$LassoCheckResult]: Loop: 238#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 241#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); 239#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 238#recENTRY [2018-11-23 15:51:43,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:43,372 INFO L82 PathProgramCache]: Analyzing trace with hash -498407605, now seen corresponding path program 1 times [2018-11-23 15:51:43,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:43,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:43,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:43,373 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:43,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:43,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:43,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:43,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:43,393 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 1 times [2018-11-23 15:51:43,393 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:43,393 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:43,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:43,394 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:43,394 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:43,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:43,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:43,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:43,404 INFO L82 PathProgramCache]: Analyzing trace with hash -359018118, now seen corresponding path program 2 times [2018-11-23 15:51:43,404 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:43,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:43,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:43,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:43,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:43,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:43,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:43,844 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 85 [2018-11-23 15:51:44,082 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 100 [2018-11-23 15:51:44,125 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:51:44,125 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:51:44,125 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:51:44,125 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:51:44,125 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:51:44,125 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:51:44,125 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:51:44,125 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:51:44,125 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration3_Lasso [2018-11-23 15:51:44,125 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:51:44,126 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:51:44,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,260 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:44,427 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:51:44,427 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:51:44,427 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-11-23 15:51:44,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,429 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,430 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-11-23 15:51:44,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,431 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,431 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,432 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-11-23 15:51:44,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,432 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,433 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,433 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-11-23 15:51:44,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,434 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,434 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,435 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-11-23 15:51:44,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,435 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,436 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-11-23 15:51:44,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,437 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,438 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-11-23 15:51:44,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,439 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,440 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-11-23 15:51:44,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,441 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,442 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-11-23 15:51:44,442 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,442 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,442 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,442 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,442 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,443 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,443 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,444 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-11-23 15:51:44,444 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,445 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:44,445 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:44,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,447 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-11-23 15:51:44,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,448 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-11-23 15:51:44,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,450 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-11-23 15:51:44,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,452 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-11-23 15:51:44,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,452 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,453 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,453 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,454 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-11-23 15:51:44,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,454 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,454 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,456 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-11-23 15:51:44,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:44,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:44,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:44,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,457 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-11-23 15:51:44,458 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,458 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,458 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,458 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,459 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:44,459 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:44,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,464 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-11-23 15:51:44,465 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,465 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:51:44,465 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:51:44,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,467 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 15:51:44,467 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:51:44,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:44,475 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-11-23 15:51:44,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:44,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:44,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:44,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:44,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:44,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:44,496 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:51:44,503 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 15:51:44,503 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-23 15:51:44,504 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:51:44,504 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:51:44,505 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:51:44,505 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-11-23 15:51:44,519 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 15:51:44,527 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:51:44,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:44,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:44,586 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:44,644 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-11-23 15:51:44,647 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-11-23 15:51:44,648 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:44,668 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:44,674 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-11-23 15:51:44,676 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 15:51:44,689 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:51:44,698 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-11-23 15:51:44,698 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:36, output treesize:54 [2018-11-23 15:51:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:44,718 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-11-23 15:51:44,718 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-23 15:51:44,766 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 51 states and 60 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 99 states and 122 transitions. Complement of second has 17 states. [2018-11-23 15:51:44,767 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-11-23 15:51:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 15:51:44,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-23 15:51:44,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-23 15:51:44,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:44,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 12 letters. Loop has 3 letters. [2018-11-23 15:51:44,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:44,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 9 letters. Loop has 6 letters. [2018-11-23 15:51:44,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:44,769 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 99 states and 122 transitions. [2018-11-23 15:51:44,772 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 15:51:44,775 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 99 states to 87 states and 110 transitions. [2018-11-23 15:51:44,775 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-11-23 15:51:44,775 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 46 [2018-11-23 15:51:44,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 110 transitions. [2018-11-23 15:51:44,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:51:44,776 INFO L705 BuchiCegarLoop]: Abstraction has 87 states and 110 transitions. [2018-11-23 15:51:44,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 110 transitions. [2018-11-23 15:51:44,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2018-11-23 15:51:44,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-11-23 15:51:44,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 102 transitions. [2018-11-23 15:51:44,782 INFO L728 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-23 15:51:44,782 INFO L608 BuchiCegarLoop]: Abstraction has 83 states and 102 transitions. [2018-11-23 15:51:44,782 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-23 15:51:44,782 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 83 states and 102 transitions. [2018-11-23 15:51:44,783 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 12 [2018-11-23 15:51:44,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:44,784 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:44,784 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:44,784 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:44,785 INFO L794 eck$LassoCheckResult]: Stem: 492#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 484#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.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; 485#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 510#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 546#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 521#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 544#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 543#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); 471#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 470#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 473#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; 482#recFINAL assume true; 505#recEXIT >#42#return; 530#L19-1 #res := #t~ret5;havoc #t~ret5; 529#recFINAL assume true; 520#recEXIT >#44#return; 508#L36-1 assume !(-1 == main_#t~ret12);main_#t~ite13 := 1; 499#L36-3 [2018-11-23 15:51:44,785 INFO L796 eck$LassoCheckResult]: Loop: 499#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 500#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 531#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 526#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 512#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 513#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 536#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); 524#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 513#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 536#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; 537#recFINAL assume true; 535#recEXIT >#42#return; 525#L19-1 #res := #t~ret5;havoc #t~ret5; 533#recFINAL assume true; 523#recEXIT >#44#return; 519#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 499#L36-3 [2018-11-23 15:51:44,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:44,785 INFO L82 PathProgramCache]: Analyzing trace with hash -713572475, now seen corresponding path program 1 times [2018-11-23 15:51:44,785 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:44,785 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:44,786 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:51:44,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:44,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:44,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:44,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 15:51:44,887 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_4fd36fdc-e6e5-4406-b927-d1dd08bb5c1e/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 15:51:44,907 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:44,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:44,937 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:44,977 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 25 treesize of output 35 [2018-11-23 15:51:44,979 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 26 treesize of output 25 [2018-11-23 15:51:44,980 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:44,995 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:45,000 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 21 treesize of output 33 [2018-11-23 15:51:45,001 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-11-23 15:51:45,014 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:51:45,021 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-11-23 15:51:45,021 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:25, output treesize:31 [2018-11-23 15:51:45,053 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-23 15:51:45,054 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:45,065 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-23 15:51:45,082 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-11-23 15:51:45,082 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:45,085 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:45,087 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 15:51:45,087 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:51, output treesize:5 [2018-11-23 15:51:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:45,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 15:51:45,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2018-11-23 15:51:45,135 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-23 15:51:45,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash 542882406, now seen corresponding path program 2 times [2018-11-23 15:51:45,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:45,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:45,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 15:51:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:45,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:45,388 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 88 [2018-11-23 15:51:45,779 WARN L180 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 126 [2018-11-23 15:51:45,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 15:51:45,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2018-11-23 15:51:45,853 INFO L87 Difference]: Start difference. First operand 83 states and 102 transitions. cyclomatic complexity: 26 Second operand 13 states. [2018-11-23 15:51:45,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 15:51:45,913 INFO L93 Difference]: Finished difference Result 85 states and 110 transitions. [2018-11-23 15:51:45,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 15:51:45,914 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 85 states and 110 transitions. [2018-11-23 15:51:45,915 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:51:45,916 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 85 states to 54 states and 67 transitions. [2018-11-23 15:51:45,916 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2018-11-23 15:51:45,917 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-23 15:51:45,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 67 transitions. [2018-11-23 15:51:45,917 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-23 15:51:45,917 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 67 transitions. [2018-11-23 15:51:45,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 67 transitions. [2018-11-23 15:51:45,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2018-11-23 15:51:45,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-11-23 15:51:45,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 54 transitions. [2018-11-23 15:51:45,921 INFO L728 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 15:51:45,921 INFO L608 BuchiCegarLoop]: Abstraction has 45 states and 54 transitions. [2018-11-23 15:51:45,921 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-23 15:51:45,921 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 45 states and 54 transitions. [2018-11-23 15:51:45,921 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 15:51:45,922 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 15:51:45,922 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 15:51:45,922 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 15:51:45,922 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 15:51:45,922 INFO L794 eck$LassoCheckResult]: Stem: 726#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 720#L-1 havoc main_#res;havoc main_#t~malloc6.base, main_#t~malloc6.offset, main_#t~nondet7, main_#t~malloc9.base, main_#t~malloc9.offset, main_#t~nondet10, main_#t~mem11, main_#t~mem14, main_#t~ret12, main_#t~ite13, main_~pp~0.base, main_~pp~0.offset, main_#t~mem8, main_~qq~0.base, main_~qq~0.offset;call main_#t~malloc6.base, main_#t~malloc6.offset := #Ultimate.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; 721#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 735#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 725#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 711#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 710#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 712#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); 718#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 741#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 717#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; 719#recFINAL assume true; 740#recEXIT >#42#return; 739#L19-1 #res := #t~ret5;havoc #t~ret5; 738#recFINAL assume true; 736#recEXIT >#44#return; 734#L36-1 assume -1 == main_#t~ret12;main_#t~ite13 := -1; 730#L36-3 call write~int(main_#t~mem14 + main_#t~ite13, main_~qq~0.base, main_~qq~0.offset, 4);havoc main_#t~ret12;havoc main_#t~mem14;havoc main_#t~ite13; 731#L28-3 call main_#t~mem8 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 713#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~mem11 := read~int(main_~pp~0.base, main_~pp~0.offset, 4); 714#L32 assume !(main_#t~mem11 < 0);havoc main_#t~mem11;call main_#t~mem14 := read~int(main_~qq~0.base, main_~qq~0.offset, 4); 709#L36 call main_#t~ret12 := rec(main_~pp~0.base, main_~pp~0.offset);< 706#recENTRY [2018-11-23 15:51:45,922 INFO L796 eck$LassoCheckResult]: Loop: 706#recENTRY ~op.base, ~op.offset := #in~op.base, #in~op.offset;call #t~mem1 := read~int(~op.base, ~op.offset, 4); 708#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); 707#L19 call #t~ret5 := rec(~ip~0.base, ~ip~0.offset);< 706#recENTRY [2018-11-23 15:51:45,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:45,923 INFO L82 PathProgramCache]: Analyzing trace with hash -873815595, now seen corresponding path program 2 times [2018-11-23 15:51:45,923 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:45,923 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:45,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:45,924 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:51:45,924 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:45,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:45,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:45,951 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:45,951 INFO L82 PathProgramCache]: Analyzing trace with hash 29956, now seen corresponding path program 2 times [2018-11-23 15:51:45,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:45,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:45,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:45,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:51:45,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:45,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:45,958 INFO L82 PathProgramCache]: Analyzing trace with hash -43609424, now seen corresponding path program 3 times [2018-11-23 15:51:45,958 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 15:51:45,958 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 15:51:45,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:45,959 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 15:51:45,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 15:51:45,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:45,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 15:51:46,342 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2018-11-23 15:51:47,095 WARN L180 SmtUtils]: Spent 627.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 186 [2018-11-23 15:51:47,212 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 111 [2018-11-23 15:51:47,423 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification that was a NOOP. DAG size: 117 [2018-11-23 15:51:47,522 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 15:51:47,522 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 15:51:47,522 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 15:51:47,522 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 15:51:47,522 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 15:51:47,522 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 15:51:47,522 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 15:51:47,522 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 15:51:47,522 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex11_true-termination.c.i_Iteration5_Lasso [2018-11-23 15:51:47,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 15:51:47,523 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 15:51:47,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,529 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,531 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 15:51:47,872 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 15:51:47,873 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 15:51:47,873 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-11-23 15:51:47,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:47,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,874 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,874 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:47,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:47,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,875 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-11-23 15:51:47,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:47,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,876 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,876 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:47,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:47,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,877 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-11-23 15:51:47,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:47,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:47,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:47,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,878 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-11-23 15:51:47,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:47,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,879 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:47,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:47,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,879 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-11-23 15:51:47,879 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,880 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,880 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:47,880 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,881 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,882 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-11-23 15:51:47,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 15:51:47,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,882 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 15:51:47,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 15:51:47,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,883 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-11-23 15:51:47,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,885 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:47,885 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,888 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-11-23 15:51:47,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,897 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:47,898 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,900 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-11-23 15:51:47,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,900 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,901 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:47,901 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,902 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-11-23 15:51:47,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,902 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:51:47,902 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 15:51:47,902 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,904 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 15:51:47,904 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 15:51:47,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,909 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-11-23 15:51:47,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,911 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,911 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:47,911 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,912 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-11-23 15:51:47,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,913 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:47,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,922 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,923 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-11-23 15:51:47,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,923 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:51:47,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,923 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,924 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:51:47,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,928 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-11-23 15:51:47,929 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,929 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:51:47,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,929 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,930 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:51:47,930 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,931 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-11-23 15:51:47,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,932 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,932 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:47,932 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,934 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-11-23 15:51:47,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,934 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 15:51:47,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,934 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,935 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-23 15:51:47,935 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 15:51:47,936 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-11-23 15:51:47,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 15:51:47,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 15:51:47,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 15:51:47,937 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 15:51:47,938 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 15:51:47,938 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 15:51:47,945 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 15:51:47,950 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-23 15:51:47,950 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-23 15:51:47,950 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 15:51:47,951 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 15:51:47,951 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 15:51:47,951 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int rec_#in~op.base) 0)_2) = 2*v_rep(select (select #memory_int rec_#in~op.base) 0)_2 + 1 Supporting invariants [] [2018-11-23 15:51:47,973 INFO L297 tatePredicateManager]: 1 out of 2 supporting invariants were superfluous and have been removed [2018-11-23 15:51:47,986 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-23 15:51:48,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:48,029 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:48,059 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:48,089 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:48,109 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-11-23 15:51:48,116 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 52 treesize of output 44 [2018-11-23 15:51:48,117 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:48,139 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:48,140 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 0 case distinctions, treesize of input 30 treesize of output 32 [2018-11-23 15:51:48,140 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:48,149 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:51:48,160 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:51:48,160 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2018-11-23 15:51:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:48,180 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-23 15:51:48,180 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-11-23 15:51:48,257 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 55 states and 65 transitions. Complement of second has 15 states. [2018-11-23 15:51:48,258 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-11-23 15:51:48,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 15:51:48,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-11-23 15:51:48,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 15:51:48,259 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:48,259 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:51:48,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:48,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:48,296 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:48,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:48,349 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:48,357 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-11-23 15:51:48,361 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2018-11-23 15:51:48,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:48,383 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 33 treesize of output 32 [2018-11-23 15:51:48,383 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:48,393 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:51:48,401 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:51:48,402 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2018-11-23 15:51:48,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:48,419 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-23 15:51:48,419 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-11-23 15:51:48,474 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 55 states and 65 transitions. Complement of second has 15 states. [2018-11-23 15:51:48,475 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-11-23 15:51:48,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 15:51:48,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-11-23 15:51:48,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 15:51:48,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:48,475 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-23 15:51:48,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 15:51:48,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:48,510 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:48,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 15:51:48,537 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 15:51:48,551 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:48,558 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 55 [2018-11-23 15:51:48,561 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 52 treesize of output 44 [2018-11-23 15:51:48,562 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:48,578 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 15:51:48,579 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 0 case distinctions, treesize of input 30 treesize of output 32 [2018-11-23 15:51:48,580 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 15:51:48,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-23 15:51:48,597 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-23 15:51:48,597 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:39, output treesize:60 [2018-11-23 15:51:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 15:51:48,615 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 3 loop predicates [2018-11-23 15:51:48,616 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13 Second operand 6 states. [2018-11-23 15:51:48,696 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 45 states and 54 transitions. cyclomatic complexity: 13. Second operand 6 states. Result 68 states and 78 transitions. Complement of second has 16 states. [2018-11-23 15:51:48,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 3 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-23 15:51:48,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 15:51:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2018-11-23 15:51:48,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 22 letters. Loop has 3 letters. [2018-11-23 15:51:48,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:48,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 25 letters. Loop has 3 letters. [2018-11-23 15:51:48,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:48,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 24 transitions. Stem has 22 letters. Loop has 6 letters. [2018-11-23 15:51:48,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 15:51:48,701 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 68 states and 78 transitions. [2018-11-23 15:51:48,702 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:51:48,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 68 states to 0 states and 0 transitions. [2018-11-23 15:51:48,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-23 15:51:48,702 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-23 15:51:48,702 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-23 15:51:48,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 15:51:48,702 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:51:48,702 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:51:48,702 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-23 15:51:48,702 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-23 15:51:48,702 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-23 15:51:48,702 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-23 15:51:48,703 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-23 15:51:48,708 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 03:51:48 BoogieIcfgContainer [2018-11-23 15:51:48,708 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 15:51:48,708 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 15:51:48,708 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 15:51:48,708 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 15:51:48,709 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 03:51:41" (3/4) ... [2018-11-23 15:51:48,711 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-23 15:51:48,711 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 15:51:48,711 INFO L168 Benchmark]: Toolchain (without parser) took 8115.32 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 223.3 MB). Free memory was 960.9 MB in the beginning and 967.4 MB in the end (delta: -6.6 MB). Peak memory consumption was 216.8 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:48,712 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:51:48,712 INFO L168 Benchmark]: CACSL2BoogieTranslator took 157.34 ms. Allocated memory is still 1.0 GB. Free memory was 960.9 MB in the beginning and 950.1 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:48,713 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.89 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 944.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:48,713 INFO L168 Benchmark]: Boogie Preprocessor took 48.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:48,713 INFO L168 Benchmark]: RCFGBuilder took 185.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:48,714 INFO L168 Benchmark]: BuchiAutomizer took 7695.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 967.4 MB in the end (delta: 148.8 MB). Peak memory consumption was 236.4 MB. Max. memory is 11.5 GB. [2018-11-23 15:51:48,714 INFO L168 Benchmark]: Witness Printer took 2.91 ms. Allocated memory is still 1.3 GB. Free memory is still 967.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 15:51:48,717 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.14 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 157.34 ms. Allocated memory is still 1.0 GB. Free memory was 960.9 MB in the beginning and 950.1 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 22.89 ms. Allocated memory is still 1.0 GB. Free memory was 950.1 MB in the beginning and 944.8 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 48.49 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 944.8 MB in the beginning and 1.1 GB in the end (delta: -185.8 MB). Peak memory consumption was 14.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 185.72 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7695.31 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 87.6 MB). Free memory was 1.1 GB in the beginning and 967.4 MB in the end (delta: 148.8 MB). Peak memory consumption was 236.4 MB. Max. memory is 11.5 GB. * Witness Printer took 2.91 ms. Allocated memory is still 1.3 GB. Free memory is still 967.4 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 8 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][op] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[op][0] + 1 and consists of 7 locations. 2 modules have a trivial ranking function, the largest among these consists of 13 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.6s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 6.1s. Construction of modules took 0.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 18 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 83 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 4/4 HoareTripleCheckerStatistics: 84 SDtfs, 57 SDslu, 153 SDs, 0 SdLazy, 256 SolverSat, 53 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital372 mio100 ax100 hnf100 lsp97 ukn40 mio100 lsp32 div100 bol100 ite100 ukn100 eq189 hnf89 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms 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...