./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/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 fe0a03f8bb40d3c8ee514a7c216e0c7ba9f8c793 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 08:34:29,071 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 08:34:29,072 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 08:34:29,079 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 08:34:29,079 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 08:34:29,080 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 08:34:29,081 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 08:34:29,082 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 08:34:29,083 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 08:34:29,083 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 08:34:29,084 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 08:34:29,084 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 08:34:29,085 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 08:34:29,086 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 08:34:29,086 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 08:34:29,087 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 08:34:29,087 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 08:34:29,089 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 08:34:29,090 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 08:34:29,091 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 08:34:29,092 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 08:34:29,093 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 08:34:29,094 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 08:34:29,094 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 08:34:29,095 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 08:34:29,095 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 08:34:29,096 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 08:34:29,097 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 08:34:29,097 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 08:34:29,098 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 08:34:29,098 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 08:34:29,099 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 08:34:29,099 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 08:34:29,099 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 08:34:29,100 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 08:34:29,100 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 08:34:29,101 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 08:34:29,111 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 08:34:29,111 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 08:34:29,112 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 08:34:29,112 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 08:34:29,112 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 08:34:29,112 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 08:34:29,112 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 08:34:29,113 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 08:34:29,113 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 08:34:29,113 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 08:34:29,113 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 08:34:29,113 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 08:34:29,113 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 08:34:29,113 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 08:34:29,113 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 08:34:29,114 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 08:34:29,114 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 08:34:29,114 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 08:34:29,114 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 08:34:29,114 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 08:34:29,114 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 08:34:29,114 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 08:34:29,115 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 08:34:29,115 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 08:34:29,115 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 08:34:29,115 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 08:34:29,115 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 08:34:29,115 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 08:34:29,116 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 08:34:29,116 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_75c4703d-b079-4336-a021-39fb8face111/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 -> fe0a03f8bb40d3c8ee514a7c216e0c7ba9f8c793 [2018-11-18 08:34:29,137 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 08:34:29,144 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 08:34:29,146 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 08:34:29,147 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 08:34:29,147 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 08:34:29,148 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-18 08:34:29,183 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/data/1e326887d/20edb18feaff4742abf02a9a4561fd16/FLAG300b44c15 [2018-11-18 08:34:29,626 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 08:34:29,627 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/sv-benchmarks/c/termination-memory-alloca/a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-18 08:34:29,638 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/data/1e326887d/20edb18feaff4742abf02a9a4561fd16/FLAG300b44c15 [2018-11-18 08:34:29,646 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/data/1e326887d/20edb18feaff4742abf02a9a4561fd16 [2018-11-18 08:34:29,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 08:34:29,649 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 08:34:29,650 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:29,650 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 08:34:29,653 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 08:34:29,653 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,655 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c938308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:29, skipping insertion in model container [2018-11-18 08:34:29,656 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 08:34:29" (1/1) ... [2018-11-18 08:34:29,663 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 08:34:29,692 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 08:34:29,884 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:29,893 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 08:34:29,920 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 08:34:30,003 INFO L195 MainTranslator]: Completed translation [2018-11-18 08:34:30,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30 WrapperNode [2018-11-18 08:34:30,003 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 08:34:30,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:30,004 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 08:34:30,004 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 08:34:30,012 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,021 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,035 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 08:34:30,035 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 08:34:30,035 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 08:34:30,035 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 08:34:30,042 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,044 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,044 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,047 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,050 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,051 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... [2018-11-18 08:34:30,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 08:34:30,052 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 08:34:30,052 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 08:34:30,052 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 08:34:30,053 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 08:34:30,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 08:34:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 08:34:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 08:34:30,098 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 08:34:30,098 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 08:34:30,298 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 08:34:30,298 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:30 BoogieIcfgContainer [2018-11-18 08:34:30,299 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 08:34:30,299 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 08:34:30,299 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 08:34:30,302 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 08:34:30,303 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:30,303 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 08:34:29" (1/3) ... [2018-11-18 08:34:30,304 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19f1894d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:30, skipping insertion in model container [2018-11-18 08:34:30,304 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:30,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 08:34:30" (2/3) ... [2018-11-18 08:34:30,305 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@19f1894d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 08:34:30, skipping insertion in model container [2018-11-18 08:34:30,305 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 08:34:30,305 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:30" (3/3) ... [2018-11-18 08:34:30,307 INFO L375 chiAutomizerObserver]: Analyzing ICFG a.10-alloca_true-termination_true-no-overflow.c.i [2018-11-18 08:34:30,352 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 08:34:30,353 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 08:34:30,353 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 08:34:30,353 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 08:34:30,353 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 08:34:30,354 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 08:34:30,354 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 08:34:30,354 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 08:34:30,354 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 08:34:30,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-18 08:34:30,386 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:30,386 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:30,386 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:30,390 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:30,390 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:30,391 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 08:34:30,391 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2018-11-18 08:34:30,392 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:30,392 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:30,392 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:30,392 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 08:34:30,392 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:30,398 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 12#L556-2true [2018-11-18 08:34:30,398 INFO L796 eck$LassoCheckResult]: Loop: 12#L556-2true assume true; 13#L555-1true call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 4#L555-2true assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 8#L556true assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 12#L556-2true [2018-11-18 08:34:30,402 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,402 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 08:34:30,403 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,506 INFO L82 PathProgramCache]: Analyzing trace with hash 1110374, now seen corresponding path program 1 times [2018-11-18 08:34:30,507 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,507 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,508 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,508 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,509 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:30,527 INFO L82 PathProgramCache]: Analyzing trace with hash 889537576, now seen corresponding path program 1 times [2018-11-18 08:34:30,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:30,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,529 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:30,529 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:30,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:30,691 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 41 [2018-11-18 08:34:30,935 WARN L180 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-18 08:34:31,038 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:31,039 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:31,039 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:31,039 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:31,039 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:31,040 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:31,040 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:31,040 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:31,040 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-18 08:34:31,040 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:31,040 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:31,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:31,328 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-11-18 08:34:31,650 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:31,655 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:31,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,661 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,665 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,667 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,673 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,687 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,687 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,689 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,718 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,719 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,719 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:31,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,724 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:31,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:31,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:31,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:31,726 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:31,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:31,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:31,726 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:31,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:31,729 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:31,756 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:31,774 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 08:34:31,775 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 08:34:31,777 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:31,779 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:31,779 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:31,779 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 Supporting invariants [] [2018-11-18 08:34:31,838 INFO L297 tatePredicateManager]: 20 out of 20 supporting invariants were superfluous and have been removed [2018-11-18 08:34:31,843 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:31,843 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:31,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:31,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:31,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:31,900 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-18 08:34:31,901 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 4 states. [2018-11-18 08:34:31,952 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 4 states. Result 34 states and 39 transitions. Complement of second has 8 states. [2018-11-18 08:34:31,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:31,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-18 08:34:31,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-11-18 08:34:31,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-18 08:34:31,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:31,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 6 letters. Loop has 4 letters. [2018-11-18 08:34:31,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:31,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 2 letters. Loop has 8 letters. [2018-11-18 08:34:31,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:31,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 34 states and 39 transitions. [2018-11-18 08:34:31,959 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:31,962 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 34 states to 14 states and 17 transitions. [2018-11-18 08:34:31,963 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 08:34:31,963 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 08:34:31,964 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 17 transitions. [2018-11-18 08:34:31,964 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:31,964 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 08:34:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 17 transitions. [2018-11-18 08:34:31,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2018-11-18 08:34:31,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 08:34:31,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 17 transitions. [2018-11-18 08:34:31,982 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 08:34:31,982 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 17 transitions. [2018-11-18 08:34:31,982 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 08:34:31,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 17 transitions. [2018-11-18 08:34:31,983 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:31,983 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:31,983 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:31,984 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 08:34:31,984 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:31,984 INFO L794 eck$LassoCheckResult]: Stem: 177#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 171#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 172#L556-2 assume true; 180#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 173#L555-2 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 174#L556 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 178#L556-2 [2018-11-18 08:34:31,984 INFO L796 eck$LassoCheckResult]: Loop: 178#L556-2 assume true; 182#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 184#L555-2 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 183#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 178#L556-2 [2018-11-18 08:34:31,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:31,984 INFO L82 PathProgramCache]: Analyzing trace with hash 889537578, now seen corresponding path program 1 times [2018-11-18 08:34:31,985 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:31,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:31,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,986 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:31,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1110374, now seen corresponding path program 2 times [2018-11-18 08:34:32,014 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,014 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,015 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,026 INFO L82 PathProgramCache]: Analyzing trace with hash -350881521, now seen corresponding path program 1 times [2018-11-18 08:34:32,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:32,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:32,159 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:32,159 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-18 08:34:32,190 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:32,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:32,246 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:32,250 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-18 08:34:32,264 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:32,265 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:32,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-18 08:34:32,266 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:32,277 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:32,287 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:32,287 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:20, output treesize:4 [2018-11-18 08:34:32,313 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:32,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 46 [2018-11-18 08:34:32,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:32,330 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 31 [2018-11-18 08:34:32,331 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:32,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:32,349 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:32,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:45, output treesize:32 [2018-11-18 08:34:32,361 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2018-11-18 08:34:32,364 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-18 08:34:32,364 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:32,370 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2018-11-18 08:34:32,370 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:32,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:32,375 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:32,376 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:30, output treesize:3 [2018-11-18 08:34:32,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:32,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:32,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2018-11-18 08:34:32,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-18 08:34:32,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-11-18 08:34:32,465 INFO L87 Difference]: Start difference. First operand 14 states and 17 transitions. cyclomatic complexity: 5 Second operand 9 states. [2018-11-18 08:34:32,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:32,534 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-18 08:34:32,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-18 08:34:32,535 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-18 08:34:32,535 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:32,536 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2018-11-18 08:34:32,536 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2018-11-18 08:34:32,536 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2018-11-18 08:34:32,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-18 08:34:32,536 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:32,536 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-18 08:34:32,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-18 08:34:32,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-11-18 08:34:32,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 08:34:32,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 13 transitions. [2018-11-18 08:34:32,538 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 08:34:32,538 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 13 transitions. [2018-11-18 08:34:32,538 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 08:34:32,538 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 13 transitions. [2018-11-18 08:34:32,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:32,538 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:32,538 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:32,539 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 08:34:32,539 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:32,539 INFO L794 eck$LassoCheckResult]: Stem: 250#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 244#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 245#L556-2 assume true; 253#L555-1 [2018-11-18 08:34:32,539 INFO L796 eck$LassoCheckResult]: Loop: 253#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 246#L555-2 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 247#L556 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 251#L556-2 assume true; 253#L555-1 [2018-11-18 08:34:32,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 08:34:32,539 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,539 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,540 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,540 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1174906, now seen corresponding path program 1 times [2018-11-18 08:34:32,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:32,562 INFO L82 PathProgramCache]: Analyzing trace with hash 1805861148, now seen corresponding path program 2 times [2018-11-18 08:34:32,562 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:32,562 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:32,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 08:34:32,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:32,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:32,763 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 81 [2018-11-18 08:34:32,824 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 08:34:32,824 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 08:34:32,824 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 08:34:32,824 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 08:34:32,824 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 08:34:32,824 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 08:34:32,825 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 08:34:32,825 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 08:34:32,825 INFO L131 ssoRankerPreferences]: Filename of dumped script: a.10-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-18 08:34:32,825 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 08:34:32,825 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 08:34:32,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:32,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,036 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,037 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 08:34:33,275 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 08:34:33,275 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 08:34:33,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,282 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,288 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,288 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,291 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,292 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,296 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,299 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,299 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,302 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,302 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 08:34:33,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 08:34:33,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 08:34:33,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,308 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,308 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,308 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,313 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,313 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,325 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,326 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,326 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,328 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,329 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,329 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 08:34:33,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 08:34:33,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 08:34:33,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 08:34:33,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 08:34:33,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 08:34:33,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 08:34:33,336 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 08:34:33,349 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 08:34:33,360 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 08:34:33,360 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 08:34:33,361 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 08:34:33,362 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 08:34:33,362 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 08:34:33,362 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-11-18 08:34:33,448 INFO L297 tatePredicateManager]: 23 out of 23 supporting invariants were superfluous and have been removed [2018-11-18 08:34:33,450 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:33,450 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 08:34:33,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,469 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,477 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 64 [2018-11-18 08:34:33,522 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 44 [2018-11-18 08:34:33,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:33,548 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,550 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 47 [2018-11-18 08:34:33,551 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:33,567 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:34:33,582 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 08:34:33,583 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:54, output treesize:98 [2018-11-18 08:34:33,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:33,609 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-11-18 08:34:33,609 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4 Second operand 5 states. [2018-11-18 08:34:33,634 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states and 13 transitions. cyclomatic complexity: 4. Second operand 5 states. Result 25 states and 28 transitions. Complement of second has 9 states. [2018-11-18 08:34:33,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 08:34:33,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 08:34:33,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 8 transitions. [2018-11-18 08:34:33,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 4 letters. [2018-11-18 08:34:33,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 7 letters. Loop has 4 letters. [2018-11-18 08:34:33,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 8 transitions. Stem has 3 letters. Loop has 8 letters. [2018-11-18 08:34:33,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 08:34:33,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 25 states and 28 transitions. [2018-11-18 08:34:33,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:33,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 25 states to 14 states and 15 transitions. [2018-11-18 08:34:33,637 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2018-11-18 08:34:33,637 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2018-11-18 08:34:33,637 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 15 transitions. [2018-11-18 08:34:33,638 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 08:34:33,638 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 15 transitions. [2018-11-18 08:34:33,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 15 transitions. [2018-11-18 08:34:33,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 11. [2018-11-18 08:34:33,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 08:34:33,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 12 transitions. [2018-11-18 08:34:33,639 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-18 08:34:33,639 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 12 transitions. [2018-11-18 08:34:33,639 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 08:34:33,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 12 transitions. [2018-11-18 08:34:33,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-11-18 08:34:33,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 08:34:33,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 08:34:33,640 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1] [2018-11-18 08:34:33,640 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-11-18 08:34:33,641 INFO L794 eck$LassoCheckResult]: Stem: 428#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 422#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet12, main_#t~nondet13, main_#t~ret14;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y := main_#t~nondet12, main_#t~nondet13;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~mem10, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem11, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 423#L556-2 assume true; 431#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 426#L555-2 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 427#L556 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem9, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem9; 430#L556-2 assume true; 432#L555-1 [2018-11-18 08:34:33,641 INFO L796 eck$LassoCheckResult]: Loop: 432#L555-1 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 424#L555-2 assume !!!(test_fun_#t~mem5 == test_fun_#t~mem6);havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 425#L556 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem7;havoc test_fun_#t~mem8;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem10, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 429#L556-2 assume true; 432#L555-1 [2018-11-18 08:34:33,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,641 INFO L82 PathProgramCache]: Analyzing trace with hash 1805861086, now seen corresponding path program 2 times [2018-11-18 08:34:33,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,641 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,642 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:33,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,658 INFO L82 PathProgramCache]: Analyzing trace with hash 1174906, now seen corresponding path program 2 times [2018-11-18 08:34:33,658 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,658 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:33,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 08:34:33,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 08:34:33,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1950316503, now seen corresponding path program 2 times [2018-11-18 08:34:33,666 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 08:34:33,667 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 08:34:33,667 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,669 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 08:34:33,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 08:34:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 08:34:33,762 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:33,763 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 08:34:33,763 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_75c4703d-b079-4336-a021-39fb8face111/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-11-18 08:34:33,783 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-18 08:34:33,803 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-18 08:34:33,803 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-18 08:34:33,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 08:34:33,842 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,843 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,845 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,846 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2018-11-18 08:34:33,852 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,862 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 52 [2018-11-18 08:34:33,864 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 08:34:33,875 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:33,880 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:33,881 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:37, output treesize:22 [2018-11-18 08:34:33,919 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 08:34:33,920 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2018-11-18 08:34:33,926 INFO L477 Elim1Store]: Elim1 applied some preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2018-11-18 08:34:33,929 INFO L267 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-11-18 08:34:33,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2018-11-18 08:34:33,941 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 08:34:33,942 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:33,945 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 08:34:33,946 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:42, output treesize:5 [2018-11-18 08:34:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 08:34:33,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 08:34:33,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2018-11-18 08:34:34,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-18 08:34:34,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2018-11-18 08:34:34,025 INFO L87 Difference]: Start difference. First operand 11 states and 12 transitions. cyclomatic complexity: 3 Second operand 12 states. [2018-11-18 08:34:34,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 08:34:34,100 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-11-18 08:34:34,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 08:34:34,100 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 13 states and 13 transitions. [2018-11-18 08:34:34,101 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:34,101 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 13 states to 0 states and 0 transitions. [2018-11-18 08:34:34,101 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 08:34:34,102 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 08:34:34,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 08:34:34,102 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 08:34:34,102 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:34,102 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:34,102 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 08:34:34,102 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 08:34:34,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 08:34:34,102 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 08:34:34,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 08:34:34,106 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 08:34:34 BoogieIcfgContainer [2018-11-18 08:34:34,106 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 08:34:34,107 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 08:34:34,107 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 08:34:34,107 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 08:34:34,107 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 08:34:30" (3/4) ... [2018-11-18 08:34:34,110 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 08:34:34,111 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 08:34:34,111 INFO L168 Benchmark]: Toolchain (without parser) took 4462.96 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 311.4 MB). Free memory was 956.6 MB in the beginning and 1.3 GB in the end (delta: -323.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:34,112 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:34,112 INFO L168 Benchmark]: CACSL2BoogieTranslator took 353.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:34,113 INFO L168 Benchmark]: Boogie Procedure Inliner took 31.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:34,113 INFO L168 Benchmark]: Boogie Preprocessor took 16.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:34,113 INFO L168 Benchmark]: RCFGBuilder took 246.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:34,114 INFO L168 Benchmark]: BuchiAutomizer took 3807.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -192.9 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 08:34:34,114 INFO L168 Benchmark]: Witness Printer took 4.07 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. [2018-11-18 08:34:34,117 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 353.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.1 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -164.3 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 31.08 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 16.85 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 246.49 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 25.2 MB). Peak memory consumption was 25.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3807.36 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 180.4 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -192.9 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 4.07 ms. Allocated memory is still 1.3 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 4 terminating modules (2 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[y_ref][y_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[x_ref][x_ref] and consists of 5 locations. 2 modules have a trivial ranking function, the largest among these consists of 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.7s and 5 iterations. TraceHistogramMax:2. Analysis of lassos took 3.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 3. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 19 SDtfs, 16 SDslu, 44 SDs, 0 SdLazy, 102 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc2 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital249 mio100 ax107 hnf100 lsp91 ukn65 mio100 lsp34 div100 bol100 ite100 ukn100 eq196 hnf87 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 6ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 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...