./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/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 f7c8cd0f6441598a9b17eacee015376606f871a4 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 04:08:17,343 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 04:08:17,343 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 04:08:17,349 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 04:08:17,350 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 04:08:17,350 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 04:08:17,351 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 04:08:17,352 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 04:08:17,353 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 04:08:17,353 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 04:08:17,353 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 04:08:17,354 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 04:08:17,354 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 04:08:17,354 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 04:08:17,355 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 04:08:17,355 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 04:08:17,356 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 04:08:17,357 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 04:08:17,358 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 04:08:17,358 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 04:08:17,359 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 04:08:17,360 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 04:08:17,361 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 04:08:17,361 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 04:08:17,361 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 04:08:17,361 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 04:08:17,362 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 04:08:17,362 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 04:08:17,363 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 04:08:17,363 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 04:08:17,363 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 04:08:17,364 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 04:08:17,364 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 04:08:17,364 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 04:08:17,365 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 04:08:17,365 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 04:08:17,365 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-09 04:08:17,373 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 04:08:17,373 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 04:08:17,374 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-09 04:08:17,374 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-09 04:08:17,374 INFO L133 SettingsManager]: * Use SBE=true [2018-12-09 04:08:17,374 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-09 04:08:17,374 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-09 04:08:17,374 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-09 04:08:17,374 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-09 04:08:17,374 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-09 04:08:17,375 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-09 04:08:17,375 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-09 04:08:17,376 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 04:08:17,376 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 04:08:17,376 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-09 04:08:17,376 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 04:08:17,376 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-09 04:08:17,376 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-09 04:08:17,377 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-09 04:08:17,377 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_39260e16-42c7-4b0e-b53d-a1802b512a4b/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 -> f7c8cd0f6441598a9b17eacee015376606f871a4 [2018-12-09 04:08:17,395 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 04:08:17,403 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 04:08:17,406 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 04:08:17,407 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 04:08:17,407 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 04:08:17,408 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i [2018-12-09 04:08:17,451 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/data/4d6d27a3c/190b8ac1555346bc99ecbb7e8786e313/FLAG59edd64ea [2018-12-09 04:08:17,857 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 04:08:17,857 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5_true-termination.c.i [2018-12-09 04:08:17,861 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/data/4d6d27a3c/190b8ac1555346bc99ecbb7e8786e313/FLAG59edd64ea [2018-12-09 04:08:17,869 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/data/4d6d27a3c/190b8ac1555346bc99ecbb7e8786e313 [2018-12-09 04:08:17,871 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 04:08:17,871 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 04:08:17,872 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 04:08:17,872 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 04:08:17,874 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 04:08:17,874 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:17,876 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6304a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17, skipping insertion in model container [2018-12-09 04:08:17,876 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:17,880 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 04:08:17,890 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 04:08:17,974 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:08:17,981 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 04:08:17,991 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 04:08:17,999 INFO L195 MainTranslator]: Completed translation [2018-12-09 04:08:17,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17 WrapperNode [2018-12-09 04:08:18,000 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 04:08:18,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 04:08:18,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 04:08:18,000 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 04:08:18,005 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:18,009 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:18,020 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 04:08:18,020 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 04:08:18,020 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 04:08:18,020 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 04:08:18,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:18,053 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:18,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:18,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:18,057 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:18,058 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:18,059 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (1/1) ... [2018-12-09 04:08:18,060 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 04:08:18,060 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 04:08:18,060 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 04:08:18,060 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 04:08:18,061 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:08:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-09 04:08:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-09 04:08:18,092 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-12-09 04:08:18,093 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-12-09 04:08:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-12-09 04:08:18,093 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-12-09 04:08:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 04:08:18,093 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 04:08:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-09 04:08:18,093 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-09 04:08:18,218 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 04:08:18,218 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-12-09 04:08:18,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:08:18 BoogieIcfgContainer [2018-12-09 04:08:18,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 04:08:18,219 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-09 04:08:18,219 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-09 04:08:18,221 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-09 04:08:18,221 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:08:18,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 09.12 04:08:17" (1/3) ... [2018-12-09 04:08:18,222 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c11674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 04:08:18, skipping insertion in model container [2018-12-09 04:08:18,222 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:08:18,222 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 04:08:17" (2/3) ... [2018-12-09 04:08:18,222 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@37c11674 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 09.12 04:08:18, skipping insertion in model container [2018-12-09 04:08:18,223 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-09 04:08:18,223 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:08:18" (3/3) ... [2018-12-09 04:08:18,224 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5_true-termination.c.i [2018-12-09 04:08:18,255 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-09 04:08:18,256 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-09 04:08:18,256 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-09 04:08:18,256 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-09 04:08:18,256 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 04:08:18,256 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 04:08:18,256 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-09 04:08:18,256 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 04:08:18,256 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-09 04:08:18,265 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-12-09 04:08:18,279 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:08:18,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:08:18,280 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:08:18,284 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 04:08:18,284 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:08:18,284 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-09 04:08:18,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states. [2018-12-09 04:08:18,286 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:08:18,286 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:08:18,286 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:08:18,286 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 04:08:18,286 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:08:18,291 INFO L794 eck$LassoCheckResult]: Stem: 14#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 12#L-1true havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 13#L63true assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 8#L63-2true assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 21#L66true call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 18#fENTRYtrue [2018-12-09 04:08:18,291 INFO L796 eck$LassoCheckResult]: Loop: 18#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 11#L17true assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 19#L25true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 15#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 3#L34true assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 4#gFINALtrue assume true; 7#gEXITtrue >#37#return; 22#L25-1true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 18#fENTRYtrue [2018-12-09 04:08:18,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:18,294 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 1 times [2018-12-09 04:08:18,295 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:18,296 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:08:18,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:18,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:18,381 INFO L82 PathProgramCache]: Analyzing trace with hash -1513071857, now seen corresponding path program 1 times [2018-12-09 04:08:18,381 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:18,381 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:18,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:08:18,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:18,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:08:18,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 04:08:18,475 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-12-09 04:08:18,478 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:08:18,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 04:08:18,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-09 04:08:18,488 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 6 states. [2018-12-09 04:08:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:08:18,557 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2018-12-09 04:08:18,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 04:08:18,559 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 26 states and 32 transitions. [2018-12-09 04:08:18,561 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:08:18,567 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 26 states to 17 states and 20 transitions. [2018-12-09 04:08:18,568 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-09 04:08:18,568 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-09 04:08:18,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-12-09 04:08:18,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:08:18,570 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-09 04:08:18,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-12-09 04:08:18,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-12-09 04:08:18,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-12-09 04:08:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 20 transitions. [2018-12-09 04:08:18,596 INFO L728 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-09 04:08:18,596 INFO L608 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-12-09 04:08:18,596 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-09 04:08:18,596 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states and 20 transitions. [2018-12-09 04:08:18,597 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:08:18,597 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:08:18,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:08:18,597 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 04:08:18,598 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:08:18,598 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 73#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 67#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 68#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 75#fENTRY [2018-12-09 04:08:18,598 INFO L796 eck$LassoCheckResult]: Loop: 75#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 70#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 61#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 65#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 60#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 62#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 65#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 60#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 63#gFINAL assume true; 64#gEXIT >#41#return; 66#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 69#gFINAL assume true; 76#gEXIT >#37#return; 71#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 75#fENTRY [2018-12-09 04:08:18,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:18,598 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 2 times [2018-12-09 04:08:18,598 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:18,598 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:18,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:08:18,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:18,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:18,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:18,622 INFO L82 PathProgramCache]: Analyzing trace with hash 916774883, now seen corresponding path program 1 times [2018-12-09 04:08:18,623 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:18,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:18,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,623 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:08:18,623 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:18,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 04:08:18,709 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:08:18,709 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/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-12-09 04:08:18,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:08:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:18,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:18,758 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 04:08:18,760 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 10 treesize of output 9 [2018-12-09 04:08:18,761 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:18,762 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:18,766 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:18,766 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-12-09 04:08:18,821 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-09 04:08:18,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:08:18,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-12-09 04:08:18,838 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-09 04:08:18,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-09 04:08:18,839 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-12-09 04:08:18,839 INFO L87 Difference]: Start difference. First operand 17 states and 20 transitions. cyclomatic complexity: 5 Second operand 13 states. [2018-12-09 04:08:18,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:08:18,930 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2018-12-09 04:08:18,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 04:08:18,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 20 states and 23 transitions. [2018-12-09 04:08:18,931 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:08:18,932 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 20 states to 20 states and 23 transitions. [2018-12-09 04:08:18,932 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 20 [2018-12-09 04:08:18,932 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2018-12-09 04:08:18,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 23 transitions. [2018-12-09 04:08:18,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:08:18,932 INFO L705 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 04:08:18,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 23 transitions. [2018-12-09 04:08:18,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 04:08:18,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 04:08:18,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2018-12-09 04:08:18,934 INFO L728 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 04:08:18,934 INFO L608 BuchiCegarLoop]: Abstraction has 20 states and 23 transitions. [2018-12-09 04:08:18,934 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-09 04:08:18,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 23 transitions. [2018-12-09 04:08:18,935 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 7 [2018-12-09 04:08:18,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:08:18,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:08:18,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-09 04:08:18,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-09 04:08:18,936 INFO L794 eck$LassoCheckResult]: Stem: 172#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 170#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 171#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 165#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 166#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 173#fENTRY [2018-12-09 04:08:18,936 INFO L796 eck$LassoCheckResult]: Loop: 173#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 168#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 159#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 163#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 158#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 160#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 163#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 158#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 160#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 163#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 158#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 161#gFINAL assume true; 162#gEXIT >#41#return; 164#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 167#gFINAL assume true; 177#gEXIT >#41#return; 175#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 176#gFINAL assume true; 174#gEXIT >#37#return; 169#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 173#fENTRY [2018-12-09 04:08:18,936 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:18,936 INFO L82 PathProgramCache]: Analyzing trace with hash 44919073, now seen corresponding path program 3 times [2018-12-09 04:08:18,936 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:18,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:18,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:08:18,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:18,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:18,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1267451407, now seen corresponding path program 2 times [2018-12-09 04:08:18,951 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:18,951 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:18,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,952 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:08:18,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:18,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:18,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:18,974 INFO L82 PathProgramCache]: Analyzing trace with hash -2054594769, now seen corresponding path program 1 times [2018-12-09 04:08:18,974 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:18,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:18,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,975 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:08:18,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:18,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:19,276 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-12-09 04:08:19,574 WARN L180 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2018-12-09 04:08:19,935 WARN L180 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 120 [2018-12-09 04:08:20,214 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-12-09 04:08:20,354 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 04:08:20,355 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 04:08:20,355 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 04:08:20,355 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 04:08:20,355 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 04:08:20,355 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:08:20,355 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 04:08:20,355 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 04:08:20,355 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration3_Lasso [2018-12-09 04:08:20,355 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 04:08:20,356 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 04:08:20,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,457 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,459 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,460 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,461 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,463 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,465 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,467 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,469 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,470 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:20,625 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 04:08:20,628 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 04:08:20,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,631 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:20,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:20,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,635 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:20,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,637 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:20,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,638 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:20,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,639 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:20,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,641 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:20,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,642 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:20,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:08:20,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:20,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,646 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,646 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:20,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,648 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:20,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,649 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,649 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 04:08:20,649 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,649 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 04:08:20,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,650 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,651 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:08:20,651 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:20,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,656 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,657 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 04:08:20,657 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,657 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 04:08:20,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:20,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,658 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-09 04:08:20,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,658 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-09 04:08:20,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:20,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:20,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:20,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:20,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:20,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:20,660 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:20,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:08:20,660 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:20,665 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 04:08:20,668 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 04:08:20,668 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 04:08:20,670 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 04:08:20,670 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 04:08:20,671 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 04:08:20,671 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~v) = 2*f_#in~v + 1 Supporting invariants [] [2018-12-09 04:08:20,673 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-09 04:08:20,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:20,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:20,695 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:20,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:20,747 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-12-09 04:08:20,749 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-09 04:08:20,749 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-12-09 04:08:20,809 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 20 states and 23 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 63 states and 72 transitions. Complement of second has 15 states. [2018-12-09 04:08:20,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 04:08:20,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 04:08:20,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-12-09 04:08:20,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 20 letters. [2018-12-09 04:08:20,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:20,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 25 letters. Loop has 20 letters. [2018-12-09 04:08:20,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:20,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 5 letters. Loop has 40 letters. [2018-12-09 04:08:20,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:20,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 72 transitions. [2018-12-09 04:08:20,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:08:20,816 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 40 states and 47 transitions. [2018-12-09 04:08:20,816 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-12-09 04:08:20,816 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-09 04:08:20,816 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 47 transitions. [2018-12-09 04:08:20,816 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 04:08:20,817 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 47 transitions. [2018-12-09 04:08:20,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 47 transitions. [2018-12-09 04:08:20,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 29. [2018-12-09 04:08:20,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-09 04:08:20,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-12-09 04:08:20,819 INFO L728 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-12-09 04:08:20,819 INFO L608 BuchiCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-12-09 04:08:20,819 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-09 04:08:20,819 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 29 states and 34 transitions. [2018-12-09 04:08:20,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:08:20,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:08:20,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:08:20,819 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:08:20,819 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 04:08:20,820 INFO L794 eck$LassoCheckResult]: Stem: 377#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 375#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 376#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 368#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 369#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 378#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 371#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 359#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 365#gENTRY [2018-12-09 04:08:20,820 INFO L796 eck$LassoCheckResult]: Loop: 365#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 357#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 358#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 365#gENTRY [2018-12-09 04:08:20,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:20,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1845692449, now seen corresponding path program 1 times [2018-12-09 04:08:20,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:20,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:20,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:20,820 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:08:20,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:20,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:20,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:20,837 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 1 times [2018-12-09 04:08:20,837 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:20,838 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:20,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:20,838 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:08:20,838 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:20,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:20,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:20,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:20,844 INFO L82 PathProgramCache]: Analyzing trace with hash -852415675, now seen corresponding path program 1 times [2018-12-09 04:08:20,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:20,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:20,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:20,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:08:20,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:20,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:21,198 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-12-09 04:08:21,447 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 100 [2018-12-09 04:08:21,493 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 04:08:21,493 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 04:08:21,493 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 04:08:21,493 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 04:08:21,494 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 04:08:21,494 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:08:21,494 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 04:08:21,494 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 04:08:21,494 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration4_Lasso [2018-12-09 04:08:21,494 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 04:08:21,494 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 04:08:21,496 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,497 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,498 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,502 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,573 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,574 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,575 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,576 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,577 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,578 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,579 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,581 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,584 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,590 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,591 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,593 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,595 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,598 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,599 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,600 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,602 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,605 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,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-12-09 04:08:21,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,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-12-09 04:08:21,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:21,762 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 04:08:21,762 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 04:08:21,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,763 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,765 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,767 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,768 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,768 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,771 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,772 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,772 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,772 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,772 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,772 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:08:21,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:21,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,775 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,775 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,775 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,776 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,776 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,776 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,777 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,780 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,781 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,781 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,782 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,782 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:21,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,784 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,784 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:21,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:21,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,785 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 04:08:21,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,786 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,786 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 04:08:21,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:21,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,789 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 04:08:21,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,789 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,790 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 04:08:21,790 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:21,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,794 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:08:21,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:21,798 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:21,798 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:21,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:21,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:21,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:21,799 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:21,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:08:21,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:21,808 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 04:08:21,812 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-09 04:08:21,812 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-09 04:08:21,812 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 04:08:21,813 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 04:08:21,813 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 04:08:21,813 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1 + 1 Supporting invariants [] [2018-12-09 04:08:21,815 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-12-09 04:08:21,819 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 04:08:21,833 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:21,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:21,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:21,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:21,874 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:08:21,875 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-09 04:08:21,879 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:08:21,880 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 37 treesize of output 26 [2018-12-09 04:08:21,880 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:21,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:21,886 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:21,887 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-09 04:08:21,893 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:08:21,893 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-09 04:08:21,893 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8 Second operand 4 states. [2018-12-09 04:08:21,945 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 29 states and 34 transitions. cyclomatic complexity: 8. Second operand 4 states. Result 57 states and 66 transitions. Complement of second has 15 states. [2018-12-09 04:08:21,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 04:08:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-09 04:08:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-12-09 04:08:21,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2018-12-09 04:08:21,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:21,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2018-12-09 04:08:21,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:21,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-09 04:08:21,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:21,947 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 57 states and 66 transitions. [2018-12-09 04:08:21,947 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:08:21,948 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 57 states to 40 states and 48 transitions. [2018-12-09 04:08:21,948 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 04:08:21,948 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 04:08:21,948 INFO L73 IsDeterministic]: Start isDeterministic. Operand 40 states and 48 transitions. [2018-12-09 04:08:21,948 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 04:08:21,948 INFO L705 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-12-09 04:08:21,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states and 48 transitions. [2018-12-09 04:08:21,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2018-12-09 04:08:21,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-12-09 04:08:21,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2018-12-09 04:08:21,951 INFO L728 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-12-09 04:08:21,951 INFO L608 BuchiCegarLoop]: Abstraction has 40 states and 48 transitions. [2018-12-09 04:08:21,951 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-09 04:08:21,951 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states and 48 transitions. [2018-12-09 04:08:21,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:08:21,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:08:21,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:08:21,952 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:08:21,952 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 04:08:21,952 INFO L794 eck$LassoCheckResult]: Stem: 539#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 537#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 538#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 531#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 532#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 541#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 536#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 520#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 540#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 519#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 521#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 553#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 552#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 523#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 553#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 549#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 522#gFINAL assume true; 524#gEXIT >#41#return; 530#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 533#gFINAL assume true; 548#gEXIT >#41#return; 547#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 546#gFINAL assume true; 544#gEXIT >#37#return; 535#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 542#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 534#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 518#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 525#gENTRY [2018-12-09 04:08:21,952 INFO L796 eck$LassoCheckResult]: Loop: 525#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 516#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 517#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 525#gENTRY [2018-12-09 04:08:21,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:21,952 INFO L82 PathProgramCache]: Analyzing trace with hash -853827823, now seen corresponding path program 2 times [2018-12-09 04:08:21,952 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:21,952 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:21,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:21,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 04:08:21,953 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 04:08:22,039 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 04:08:22,039 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_39260e16-42c7-4b0e-b53d-a1802b512a4b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 04:08:22,045 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-12-09 04:08:22,071 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-12-09 04:08:22,071 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 04:08:22,074 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:22,077 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 10 [2018-12-09 04:08:22,078 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 10 treesize of output 9 [2018-12-09 04:08:22,079 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:22,080 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:22,081 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:22,081 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-12-09 04:08:22,167 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-12-09 04:08:22,169 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 3 [2018-12-09 04:08:22,169 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:22,170 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:22,170 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:22,170 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2018-12-09 04:08:22,173 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-12-09 04:08:22,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-09 04:08:22,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-12-09 04:08:22,188 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-09 04:08:22,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:22,188 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 2 times [2018-12-09 04:08:22,188 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:22,188 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:22,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:22,189 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:08:22,189 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:22,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:22,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-12-09 04:08:22,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-12-09 04:08:22,255 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. cyclomatic complexity: 12 Second operand 17 states. [2018-12-09 04:08:22,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 04:08:22,372 INFO L93 Difference]: Finished difference Result 53 states and 67 transitions. [2018-12-09 04:08:22,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-09 04:08:22,372 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 53 states and 67 transitions. [2018-12-09 04:08:22,373 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:08:22,374 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 53 states to 46 states and 58 transitions. [2018-12-09 04:08:22,374 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-12-09 04:08:22,374 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2018-12-09 04:08:22,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 46 states and 58 transitions. [2018-12-09 04:08:22,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-09 04:08:22,374 INFO L705 BuchiCegarLoop]: Abstraction has 46 states and 58 transitions. [2018-12-09 04:08:22,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states and 58 transitions. [2018-12-09 04:08:22,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 43. [2018-12-09 04:08:22,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-12-09 04:08:22,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 52 transitions. [2018-12-09 04:08:22,377 INFO L728 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-12-09 04:08:22,377 INFO L608 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-12-09 04:08:22,377 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-09 04:08:22,377 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 43 states and 52 transitions. [2018-12-09 04:08:22,377 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-12-09 04:08:22,377 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-09 04:08:22,377 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-09 04:08:22,378 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 04:08:22,378 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-12-09 04:08:22,378 INFO L794 eck$LassoCheckResult]: Stem: 743#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 741#L-1 havoc main_#res;havoc main_#t~malloc11.base, main_#t~malloc11.offset, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet13, main_#t~nondet14, main_#t~mem15, main_#t~mem16, main_#t~short17, main_#t~mem18, main_#t~ret19.base, main_#t~ret19.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc11.base, main_#t~malloc11.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset;call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;call write~int(main_#t~nondet13, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet13;call write~int(main_#t~nondet14, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet14;call main_#t~mem15 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short17 := main_#t~mem15 < 0; 742#L63 assume !main_#t~short17;call main_#t~mem16 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short17 := main_#t~mem16 < 0; 734#L63-2 assume !main_#t~short17;havoc main_#t~mem15;havoc main_#t~mem16;havoc main_#t~short17;call main_#t~mem18 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 735#L66 call main_#t~ret19.base, main_#t~ret19.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem18);< 746#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 747#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 750#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 759#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 758#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 725#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 732#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 757#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 724#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 732#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 757#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 724#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 732#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 723#L34 assume #t~mem5 < 0;havoc #t~mem5;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc6.base, #t~malloc6.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc6.base, #t~malloc6.offset; 726#gFINAL assume true; 761#gEXIT >#41#return; 736#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 727#gFINAL assume true; 730#gEXIT >#41#return; 733#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 760#gFINAL assume true; 753#gEXIT >#41#return; 752#L42-1 ~np~0.base, ~np~0.offset := #t~ret9.base, #t~ret9.offset;havoc #t~ret9.base, #t~ret9.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc10.base, #t~malloc10.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc10.base, #t~malloc10.offset; 751#gFINAL assume true; 749#gEXIT >#37#return; 738#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 748#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 737#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 722#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 731#gENTRY [2018-12-09 04:08:22,378 INFO L796 eck$LassoCheckResult]: Loop: 731#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem5 := read~int(~p.base, ~p.offset, 4); 720#L34 assume !(#t~mem5 < 0);havoc #t~mem5;call #t~mem7 := read~int(~p.base, ~p.offset, 4);#t~post8 := #t~mem7;call write~int(#t~post8 - 1, ~p.base, ~p.offset, 4);havoc #t~mem7;havoc #t~post8; 721#L42 call #t~ret9.base, #t~ret9.offset := g(~p.base, ~p.offset);< 731#gENTRY [2018-12-09 04:08:22,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:22,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1079381827, now seen corresponding path program 3 times [2018-12-09 04:08:22,378 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:22,378 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:22,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:22,379 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:08:22,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:22,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:22,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:22,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:22,399 INFO L82 PathProgramCache]: Analyzing trace with hash 38883, now seen corresponding path program 3 times [2018-12-09 04:08:22,399 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:22,399 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:22,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:22,400 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:08:22,400 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:22,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:22,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:22,403 INFO L82 PathProgramCache]: Analyzing trace with hash 556146087, now seen corresponding path program 4 times [2018-12-09 04:08:22,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-09 04:08:22,403 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-09 04:08:22,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:22,404 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 04:08:22,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 04:08:22,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-09 04:08:22,695 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-12-09 04:08:22,983 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2018-12-09 04:08:23,333 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 115 [2018-12-09 04:08:23,865 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 128 [2018-12-09 04:08:24,144 WARN L180 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 117 [2018-12-09 04:08:24,316 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-12-09 04:08:25,181 WARN L180 SmtUtils]: Spent 686.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 144 [2018-12-09 04:08:25,331 WARN L180 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 112 [2018-12-09 04:08:25,333 INFO L216 LassoAnalysis]: Preferences: [2018-12-09 04:08:25,333 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-09 04:08:25,333 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-09 04:08:25,334 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-09 04:08:25,334 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-09 04:08:25,334 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-09 04:08:25,334 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-09 04:08:25,334 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-09 04:08:25,334 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5_true-termination.c.i_Iteration6_Lasso [2018-12-09 04:08:25,334 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-09 04:08:25,334 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-09 04:08:25,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,507 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,511 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,514 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,516 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,519 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,520 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,523 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,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-12-09 04:08:25,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-12-09 04:08:25,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-12-09 04:08:25,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-12-09 04:08:25,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-12-09 04:08:25,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,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-12-09 04:08:25,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-12-09 04:08:25,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-12-09 04:08:25,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,537 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,551 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,555 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-09 04:08:25,749 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-09 04:08:25,749 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-09 04:08:25,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:25,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:25,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:25,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:25,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:25,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:25,750 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:25,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:25,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:25,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:25,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:25,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:25,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:25,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:25,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:25,751 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:25,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:25,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:25,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:25,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:25,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-09 04:08:25,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:25,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:25,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:25,753 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-09 04:08:25,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-09 04:08:25,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:25,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:25,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:25,754 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-09 04:08:25,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:25,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:25,755 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-09 04:08:25,755 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:25,756 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:25,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:25,756 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:25,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:25,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:25,756 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:25,757 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:08:25,757 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:25,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-09 04:08:25,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-09 04:08:25,760 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-09 04:08:25,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-09 04:08:25,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-09 04:08:25,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-09 04:08:25,761 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-09 04:08:25,761 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-09 04:08:25,774 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-09 04:08:25,783 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-09 04:08:25,783 INFO L444 ModelExtractionUtils]: 11 out of 16 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-09 04:08:25,783 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-09 04:08:25,784 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-09 04:08:25,784 INFO L518 LassoAnalysis]: Proved termination. [2018-12-09 04:08:25,784 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2 + 1 Supporting invariants [] [2018-12-09 04:08:25,789 INFO L297 tatePredicateManager]: 2 out of 2 supporting invariants were superfluous and have been removed [2018-12-09 04:08:25,789 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 04:08:25,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:25,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:25,843 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:25,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:25,866 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:25,889 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:08:25,889 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-09 04:08:25,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:08:25,891 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 37 treesize of output 26 [2018-12-09 04:08:25,892 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:25,894 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:25,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:25,897 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-09 04:08:25,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:08:25,904 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-09 04:08:25,904 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-09 04:08:25,951 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2018-12-09 04:08:25,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 04:08:25,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 04:08:25,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-12-09 04:08:25,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2018-12-09 04:08:25,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:25,953 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 04:08:25,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:25,997 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:26,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:26,014 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:26,025 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:08:26,025 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-09 04:08:26,027 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:08:26,028 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 37 treesize of output 26 [2018-12-09 04:08:26,028 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:26,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:26,033 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:26,033 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-09 04:08:26,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:08:26,041 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-09 04:08:26,041 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-09 04:08:26,093 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 50 states and 59 transitions. Complement of second has 15 states. [2018-12-09 04:08:26,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 04:08:26,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 04:08:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-12-09 04:08:26,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2018-12-09 04:08:26,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:26,095 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-09 04:08:26,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 04:08:26,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:26,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 04:08:26,164 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 04:08:26,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:08:26,173 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-12-09 04:08:26,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 04:08:26,177 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 37 treesize of output 26 [2018-12-09 04:08:26,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-09 04:08:26,186 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:26,189 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 04:08:26,189 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-12-09 04:08:26,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 04:08:26,198 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-12-09 04:08:26,198 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13 Second operand 5 states. [2018-12-09 04:08:26,254 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 43 states and 52 transitions. cyclomatic complexity: 13. Second operand 5 states. Result 64 states and 73 transitions. Complement of second has 15 states. [2018-12-09 04:08:26,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-09 04:08:26,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-09 04:08:26,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 24 transitions. [2018-12-09 04:08:26,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 3 letters. [2018-12-09 04:08:26,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:26,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 37 letters. Loop has 3 letters. [2018-12-09 04:08:26,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:26,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 24 transitions. Stem has 34 letters. Loop has 6 letters. [2018-12-09 04:08:26,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-09 04:08:26,256 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 64 states and 73 transitions. [2018-12-09 04:08:26,256 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 04:08:26,256 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 64 states to 0 states and 0 transitions. [2018-12-09 04:08:26,256 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-09 04:08:26,257 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-09 04:08:26,257 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-09 04:08:26,257 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-09 04:08:26,257 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:08:26,257 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:08:26,257 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 04:08:26,257 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-09 04:08:26,257 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-09 04:08:26,257 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-09 04:08:26,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-09 04:08:26,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 09.12 04:08:26 BoogieIcfgContainer [2018-12-09 04:08:26,261 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-09 04:08:26,261 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 04:08:26,261 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 04:08:26,261 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 04:08:26,261 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 04:08:18" (3/4) ... [2018-12-09 04:08:26,263 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-09 04:08:26,264 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 04:08:26,264 INFO L168 Benchmark]: Toolchain (without parser) took 8393.05 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 325.1 MB). Free memory was 962.4 MB in the beginning and 925.4 MB in the end (delta: 37.0 MB). Peak memory consumption was 362.1 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:26,264 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:08:26,265 INFO L168 Benchmark]: CACSL2BoogieTranslator took 127.86 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:26,265 INFO L168 Benchmark]: Boogie Procedure Inliner took 19.69 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:26,265 INFO L168 Benchmark]: Boogie Preprocessor took 40.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:26,266 INFO L168 Benchmark]: RCFGBuilder took 158.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:26,266 INFO L168 Benchmark]: BuchiAutomizer took 8041.98 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.1 GB in the beginning and 925.4 MB in the end (delta: 146.6 MB). Peak memory consumption was 371.5 MB. Max. memory is 11.5 GB. [2018-12-09 04:08:26,266 INFO L168 Benchmark]: Witness Printer took 2.55 ms. Allocated memory is still 1.4 GB. Free memory is still 925.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 04:08:26,268 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 127.86 ms. Allocated memory is still 1.0 GB. Free memory was 962.4 MB in the beginning and 951.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 19.69 ms. Allocated memory is still 1.0 GB. Free memory was 951.7 MB in the beginning and 946.3 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.02 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.1 MB). Free memory was 946.3 MB in the beginning and 1.1 GB in the end (delta: -144.6 MB). Peak memory consumption was 13.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 158.52 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 18.9 MB). Peak memory consumption was 18.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8041.98 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 224.9 MB). Free memory was 1.1 GB in the beginning and 925.4 MB in the end (delta: 146.6 MB). Peak memory consumption was 371.5 MB. Max. memory is 11.5 GB. * Witness Printer took 2.55 ms. Allocated memory is still 1.4 GB. Free memory is still 925.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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (3 trivial, 2 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * \old(v) + 1 and consists of 5 locations. One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 5 locations. One nondeterministic module has affine ranking function 2 * unknown-#memory_int-unknown[p][p] + 1 and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 17 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 7 iterations. TraceHistogramMax:4. Analysis of lassos took 6.8s. Construction of modules took 0.2s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 43 states and ocurred in iteration 5. Nontrivial modules had stage [2, 0, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 14/14 HoareTripleCheckerStatistics: 116 SDtfs, 91 SDslu, 217 SDs, 0 SdLazy, 340 SolverSat, 64 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso3 LassoPreprocessingBenchmarks: Lassos: inital339 mio100 ax100 hnf100 lsp97 ukn35 mio100 lsp24 div100 bol100 ite100 ukn100 eq199 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 3ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...