./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.13-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_c0910c56-5b84-4cce-bcd3-38c8543dd003/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/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 72925b65ef321f719f00e79529e35268c3f3eaa3 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 12:04:56,022 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:04:56,024 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:04:56,034 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:04:56,034 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:04:56,035 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:04:56,036 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:04:56,038 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:04:56,039 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:04:56,040 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:04:56,041 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:04:56,041 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:04:56,042 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:04:56,043 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:04:56,044 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:04:56,044 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:04:56,045 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:04:56,047 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:04:56,048 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:04:56,050 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:04:56,051 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:04:56,052 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:04:56,054 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:04:56,054 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:04:56,054 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:04:56,055 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:04:56,056 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:04:56,057 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:04:56,057 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:04:56,058 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:04:56,058 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:04:56,059 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:04:56,059 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:04:56,059 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:04:56,060 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:04:56,061 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:04:56,061 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:04:56,075 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:04:56,075 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:04:56,076 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:04:56,076 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:04:56,077 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:04:56,077 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:04:56,077 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:04:56,077 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:04:56,077 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:04:56,077 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:04:56,078 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:04:56,081 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:04:56,082 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:04:56,082 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:04:56,082 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:04:56,082 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:04:56,082 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:04:56,083 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:04:56,083 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:04:56,083 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:04:56,083 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:04:56,083 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:04:56,083 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:04:56,084 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:04:56,084 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:04:56,084 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:04:56,084 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:04:56,084 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:04:56,085 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:04:56,085 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_c0910c56-5b84-4cce-bcd3-38c8543dd003/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 -> 72925b65ef321f719f00e79529e35268c3f3eaa3 [2018-11-18 12:04:56,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:04:56,121 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:04:56,123 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:04:56,124 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:04:56,125 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:04:56,125 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:04:56,170 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/bin-2019/uautomizer/data/570bb948f/f0be19d72a034b959471b6cab74d3d01/FLAGd544eea8c [2018-11-18 12:04:56,597 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:04:56,598 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/sv-benchmarks/c/termination-memory-alloca/b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:04:56,607 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/bin-2019/uautomizer/data/570bb948f/f0be19d72a034b959471b6cab74d3d01/FLAGd544eea8c [2018-11-18 12:04:56,950 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/bin-2019/uautomizer/data/570bb948f/f0be19d72a034b959471b6cab74d3d01 [2018-11-18 12:04:56,953 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:04:56,954 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:04:56,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:04:56,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:04:56,957 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:04:56,958 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:04:56" (1/1) ... [2018-11-18 12:04:56,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e04dcc0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:56, skipping insertion in model container [2018-11-18 12:04:56,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:04:56" (1/1) ... [2018-11-18 12:04:56,971 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:04:57,008 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:04:57,235 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:04:57,246 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:04:57,284 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:04:57,369 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:04:57,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57 WrapperNode [2018-11-18 12:04:57,369 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:04:57,370 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:04:57,370 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:04:57,370 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:04:57,376 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (1/1) ... [2018-11-18 12:04:57,388 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (1/1) ... [2018-11-18 12:04:57,406 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:04:57,406 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:04:57,406 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:04:57,406 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:04:57,413 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (1/1) ... [2018-11-18 12:04:57,413 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (1/1) ... [2018-11-18 12:04:57,415 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (1/1) ... [2018-11-18 12:04:57,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (1/1) ... [2018-11-18 12:04:57,420 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (1/1) ... [2018-11-18 12:04:57,425 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (1/1) ... [2018-11-18 12:04:57,426 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (1/1) ... [2018-11-18 12:04:57,429 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:04:57,429 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:04:57,429 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:04:57,429 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:04:57,430 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/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 12:04:57,476 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:04:57,476 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:04:57,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:04:57,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:04:57,476 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:04:57,476 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:04:57,692 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:04:57,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:04:57 BoogieIcfgContainer [2018-11-18 12:04:57,692 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:04:57,693 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:04:57,693 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:04:57,695 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:04:57,696 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:04:57,696 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:04:56" (1/3) ... [2018-11-18 12:04:57,697 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c45b983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:04:57, skipping insertion in model container [2018-11-18 12:04:57,697 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:04:57,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:04:57" (2/3) ... [2018-11-18 12:04:57,698 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@c45b983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:04:57, skipping insertion in model container [2018-11-18 12:04:57,698 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:04:57,698 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:04:57" (3/3) ... [2018-11-18 12:04:57,700 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.13-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:04:57,742 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:04:57,742 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:04:57,742 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:04:57,743 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:04:57,743 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:04:57,743 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:04:57,743 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:04:57,743 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:04:57,743 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:04:57,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 12:04:57,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:04:57,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:04:57,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:04:57,776 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:04:57,776 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:04:57,776 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:04:57,776 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-11-18 12:04:57,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2018-11-18 12:04:57,778 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:04:57,778 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:04:57,778 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:04:57,778 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:04:57,785 INFO L794 eck$LassoCheckResult]: Stem: 9#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 15#L561-2true [2018-11-18 12:04:57,785 INFO L796 eck$LassoCheckResult]: Loop: 15#L561-2true assume true; 5#L557-1true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 6#L557-2true assume test_fun_#t~short10; 8#L557-4true assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 3#L558true assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 15#L561-2true [2018-11-18 12:04:57,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:57,790 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:04:57,792 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:04:57,792 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:04:57,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:57,828 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:57,828 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:57,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:57,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:57,916 INFO L82 PathProgramCache]: Analyzing trace with hash 34419787, now seen corresponding path program 1 times [2018-11-18 12:04:57,916 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:04:57,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:04:57,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:57,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:57,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:57,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:57,939 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:04:57,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1805859273, now seen corresponding path program 1 times [2018-11-18 12:04:57,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:04:57,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:04:57,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:57,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:04:57,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:04:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:04:58,556 WARN L180 SmtUtils]: Spent 426.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 108 [2018-11-18 12:04:58,714 WARN L180 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 106 [2018-11-18 12:04:58,726 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:04:58,727 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:04:58,727 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:04:58,727 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:04:58,727 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:04:58,727 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:04:58,728 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:04:58,728 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:04:58,728 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-18 12:04:58,728 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:04:58,728 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:04:58,746 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 12:04:58,751 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 12:04:58,753 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 12:04:58,755 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 12:04:58,759 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 12:04:58,760 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 12:04:58,763 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 12:04:58,765 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 12:04:58,767 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 12:04:58,768 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 12:04:59,189 WARN L180 SmtUtils]: Spent 253.00 ms on a formula simplification. DAG size of input: 109 DAG size of output: 93 [2018-11-18 12:04:59,278 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 12:04:59,279 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 12:04:59,281 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 12:04:59,282 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 12:04:59,283 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 12:04:59,285 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 12:04:59,286 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 12:04:59,287 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 12:04:59,289 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 12:04:59,290 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 12:04:59,291 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 12:04:59,292 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 12:04:59,673 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:04:59,677 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:04:59,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 12:04:59,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,686 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,691 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 12:04:59,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:59,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,693 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:59,693 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:59,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,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 12:04:59,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:59,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,695 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,695 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:59,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:59,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,697 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 12:04:59,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,697 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:59,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,698 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:59,698 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:59,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,699 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 12:04:59,699 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:59,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,700 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:59,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:59,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,701 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 12:04:59,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:59,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:59,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:59,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,703 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 12:04:59,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,709 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 12:04:59,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:59,710 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,710 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:59,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:59,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,712 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 12:04:59,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:04:59,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:04:59,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:04:59,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,715 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 12:04:59,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,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 12:04:59,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,723 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:04:59,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,725 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:04:59,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,736 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 12:04:59,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,741 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,741 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,750 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 12:04:59,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,751 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:04:59,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,751 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,753 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:04:59,753 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,762 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 12:04:59,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,765 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,772 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:04:59,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,774 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:04:59,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,781 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,781 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,784 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 12:04:59,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,786 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,786 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,789 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 12:04:59,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,790 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,791 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,791 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:04:59,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,795 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,796 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,796 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,802 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 12:04:59,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,803 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,804 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,811 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,811 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 12:04:59,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,812 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:04:59,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,812 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,814 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:04:59,814 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,821 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 12:04:59,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,821 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:04:59,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,823 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:04:59,823 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,829 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 12:04:59,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,830 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,834 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,834 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:04:59,852 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 12:04:59,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:04:59,853 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:04:59,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:04:59,853 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:04:59,856 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:04:59,856 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:04:59,872 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:04:59,882 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:04:59,882 INFO L444 ModelExtractionUtils]: 24 out of 28 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 12:04:59,884 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:04:59,885 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:04:59,886 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:04:59,886 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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 12:05:00,031 INFO L297 tatePredicateManager]: 40 out of 40 supporting invariants were superfluous and have been removed [2018-11-18 12:05:00,040 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:05:00,041 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:05:00,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:00,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:05:00,086 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:05:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:05:00,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:05:00,154 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 12:05:00,165 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 12:05:00,167 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 5 states. [2018-11-18 12:05:00,275 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 5 states. Result 65 states and 83 transitions. Complement of second has 10 states. [2018-11-18 12:05:00,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 12:05:00,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:05:00,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 36 transitions. [2018-11-18 12:05:00,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-18 12:05:00,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:05:00,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-18 12:05:00,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:05:00,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 36 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-18 12:05:00,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:05:00,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 83 transitions. [2018-11-18 12:05:00,286 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-18 12:05:00,290 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 35 states and 49 transitions. [2018-11-18 12:05:00,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-11-18 12:05:00,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 22 [2018-11-18 12:05:00,293 INFO L73 IsDeterministic]: Start isDeterministic. Operand 35 states and 49 transitions. [2018-11-18 12:05:00,293 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:05:00,293 INFO L705 BuchiCegarLoop]: Abstraction has 35 states and 49 transitions. [2018-11-18 12:05:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states and 49 transitions. [2018-11-18 12:05:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-18 12:05:00,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 12:05:00,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 48 transitions. [2018-11-18 12:05:00,316 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2018-11-18 12:05:00,317 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 48 transitions. [2018-11-18 12:05:00,317 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:05:00,317 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 48 transitions. [2018-11-18 12:05:00,318 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 18 [2018-11-18 12:05:00,318 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:05:00,318 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:05:00,318 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:05:00,318 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:05:00,319 INFO L794 eck$LassoCheckResult]: Stem: 301#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 291#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 292#L561-2 assume true; 312#L557-1 [2018-11-18 12:05:00,319 INFO L796 eck$LassoCheckResult]: Loop: 312#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 317#L557-2 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 318#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 314#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 308#L561-2 assume true; 312#L557-1 [2018-11-18 12:05:00,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:00,319 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 12:05:00,319 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:00,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:00,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:00,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:00,343 INFO L82 PathProgramCache]: Analyzing trace with hash 36423549, now seen corresponding path program 1 times [2018-11-18 12:05:00,343 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:00,343 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:00,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:00,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:05:00,419 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 12:05:00,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:05:00,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:05:00,421 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:05:00,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:05:00,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:05:00,424 INFO L87 Difference]: Start difference. First operand 34 states and 48 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-18 12:05:00,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:05:00,484 INFO L93 Difference]: Finished difference Result 56 states and 75 transitions. [2018-11-18 12:05:00,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:05:00,486 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 56 states and 75 transitions. [2018-11-18 12:05:00,488 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 30 [2018-11-18 12:05:00,489 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 56 states to 44 states and 59 transitions. [2018-11-18 12:05:00,489 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-18 12:05:00,489 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-18 12:05:00,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 59 transitions. [2018-11-18 12:05:00,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:05:00,491 INFO L705 BuchiCegarLoop]: Abstraction has 44 states and 59 transitions. [2018-11-18 12:05:00,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states and 59 transitions. [2018-11-18 12:05:00,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 22. [2018-11-18 12:05:00,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2018-11-18 12:05:00,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2018-11-18 12:05:00,494 INFO L728 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-18 12:05:00,494 INFO L608 BuchiCegarLoop]: Abstraction has 22 states and 30 transitions. [2018-11-18 12:05:00,494 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:05:00,494 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 22 states and 30 transitions. [2018-11-18 12:05:00,495 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-11-18 12:05:00,495 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:05:00,495 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:05:00,496 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:05:00,496 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:05:00,496 INFO L794 eck$LassoCheckResult]: Stem: 400#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 391#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 392#L561-2 assume true; 401#L557-1 [2018-11-18 12:05:00,496 INFO L796 eck$LassoCheckResult]: Loop: 401#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 402#L557-2 assume test_fun_#t~short10; 393#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 394#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 397#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 406#L561-2 assume true; 401#L557-1 [2018-11-18 12:05:00,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:00,496 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 2 times [2018-11-18 12:05:00,496 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:00,497 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:00,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,505 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:00,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,525 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:00,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1127285618, now seen corresponding path program 1 times [2018-11-18 12:05:00,525 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:00,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:00,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:05:00,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:05:00,575 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 12:05:00,575 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:05:00,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 12:05:00,576 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:05:00,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:05:00,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:05:00,577 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-11-18 12:05:00,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:05:00,624 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2018-11-18 12:05:00,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:05:00,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 25 transitions. [2018-11-18 12:05:00,626 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-18 12:05:00,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 23 transitions. [2018-11-18 12:05:00,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 12:05:00,627 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 12:05:00,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 23 transitions. [2018-11-18 12:05:00,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:05:00,627 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 12:05:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 23 transitions. [2018-11-18 12:05:00,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 12:05:00,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 12:05:00,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2018-11-18 12:05:00,629 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 12:05:00,629 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 23 transitions. [2018-11-18 12:05:00,629 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 12:05:00,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 23 transitions. [2018-11-18 12:05:00,630 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 11 [2018-11-18 12:05:00,630 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:05:00,630 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:05:00,630 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:05:00,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:05:00,630 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 444#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 445#L561-2 assume true; 461#L557-1 [2018-11-18 12:05:00,630 INFO L796 eck$LassoCheckResult]: Loop: 461#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 459#L557-2 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 460#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 462#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 457#L561 assume !(test_fun_#t~mem14 > test_fun_#t~mem15);havoc test_fun_#t~mem14;havoc test_fun_#t~mem15; 458#L561-2 assume true; 461#L557-1 [2018-11-18 12:05:00,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:00,630 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 3 times [2018-11-18 12:05:00,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:00,631 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:00,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,631 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:00,631 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:00,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1129132660, now seen corresponding path program 1 times [2018-11-18 12:05:00,649 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:00,649 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:00,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,650 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 12:05:00,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:05:00,679 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 12:05:00,680 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 12:05:00,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 12:05:00,680 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 12:05:00,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 12:05:00,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-11-18 12:05:00,680 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. cyclomatic complexity: 6 Second operand 5 states. [2018-11-18 12:05:00,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:05:00,716 INFO L93 Difference]: Finished difference Result 18 states and 21 transitions. [2018-11-18 12:05:00,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 12:05:00,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 18 states and 21 transitions. [2018-11-18 12:05:00,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:05:00,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 18 states to 18 states and 21 transitions. [2018-11-18 12:05:00,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2018-11-18 12:05:00,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2018-11-18 12:05:00,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 21 transitions. [2018-11-18 12:05:00,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:05:00,719 INFO L705 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 12:05:00,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states and 21 transitions. [2018-11-18 12:05:00,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-18 12:05:00,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-18 12:05:00,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2018-11-18 12:05:00,720 INFO L728 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 12:05:00,720 INFO L608 BuchiCegarLoop]: Abstraction has 18 states and 21 transitions. [2018-11-18 12:05:00,721 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 12:05:00,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 18 states and 21 transitions. [2018-11-18 12:05:00,721 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:05:00,721 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:05:00,721 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:05:00,722 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-18 12:05:00,722 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-11-18 12:05:00,722 INFO L794 eck$LassoCheckResult]: Stem: 500#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 491#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 492#L561-2 assume true; 501#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 502#L557-2 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 493#L557-4 [2018-11-18 12:05:00,722 INFO L796 eck$LassoCheckResult]: Loop: 493#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 494#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 505#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 498#L561-2 assume true; 506#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 508#L557-2 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 493#L557-4 [2018-11-18 12:05:00,722 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:00,722 INFO L82 PathProgramCache]: Analyzing trace with hash 28694760, now seen corresponding path program 1 times [2018-11-18 12:05:00,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:00,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:00,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:00,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:00,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1454432438, now seen corresponding path program 1 times [2018-11-18 12:05:00,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:00,751 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:00,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:00,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,765 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:00,765 INFO L82 PathProgramCache]: Analyzing trace with hash 2053386333, now seen corresponding path program 1 times [2018-11-18 12:05:00,765 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:00,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:00,766 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:00,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:00,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:00,934 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 78 [2018-11-18 12:05:01,130 WARN L180 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 66 [2018-11-18 12:05:01,585 WARN L180 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 127 [2018-11-18 12:05:02,027 WARN L180 SmtUtils]: Spent 436.00 ms on a formula simplification that was a NOOP. DAG size: 122 [2018-11-18 12:05:02,030 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:05:02,030 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:05:02,030 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:05:02,030 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:05:02,030 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:05:02,030 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:05:02,030 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:05:02,031 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:05:02,031 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.13-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-18 12:05:02,031 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:05:02,031 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:05:02,038 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 12:05:02,050 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 12:05:02,051 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 12:05:02,052 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 12:05:02,053 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 12:05:02,055 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 12:05:02,058 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 12:05:02,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 12:05:02,061 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 12:05:02,062 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 12:05:02,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 12:05:02,766 WARN L180 SmtUtils]: Spent 560.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 106 [2018-11-18 12:05:02,906 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 79 [2018-11-18 12:05:02,907 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 12:05:02,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:05:02,915 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:05:02,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:05:02,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:05:02,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:05:03,419 WARN L180 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 52 [2018-11-18 12:05:03,550 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 38 [2018-11-18 12:05:03,683 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:05:03,683 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:05:03,683 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 12:05:03,684 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:05:03,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:05:03,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:05:03,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,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 12:05:03,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:05:03,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,691 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:05:03,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:05:03,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,693 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 12:05:03,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:05:03,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,694 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:05:03,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:05:03,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,695 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 12:05:03,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:05:03,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,696 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:05:03,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:05:03,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,697 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 12:05:03,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,697 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,698 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:05:03,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:05:03,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,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 12:05:03,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:05:03,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:05:03,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:05:03,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,701 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 12:05:03,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,703 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:05:03,703 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:05:03,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,705 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 12:05:03,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:05:03,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,706 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:05:03,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:05:03,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,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 12:05:03,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:05:03,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:05:03,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:05:03,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,709 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 12:05:03,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:05:03,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:05:03,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,712 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 12:05:03,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,713 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:05:03,713 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:05:03,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,715 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 12:05:03,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:05:03,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:05:03,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:05:03,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:05:03,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:05:03,719 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 12:05:03,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:05:03,719 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:05:03,719 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 12:05:03,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:05:03,732 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 12:05:03,733 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 12:05:03,865 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:05:03,956 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 12:05:03,956 INFO L444 ModelExtractionUtils]: 81 out of 91 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-11-18 12:05:03,957 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:05:03,958 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-18 12:05:03,959 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:05:03,959 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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_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_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 Supporting invariants [] [2018-11-18 12:05:04,157 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-18 12:05:04,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:05:04,159 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:05:04,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:05:04,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:05:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:05:04,210 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:05:04,248 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:04,272 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 44 treesize of output 58 [2018-11-18 12:05:04,283 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:04,284 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 38 [2018-11-18 12:05:04,286 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:04,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:04,329 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:04,331 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:04,334 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 34 treesize of output 49 [2018-11-18 12:05:04,335 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:04,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:05:04,419 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 12:05:04,420 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:44, output treesize:66 [2018-11-18 12:05:04,481 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 12:05:04,482 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 12:05:04,482 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5 Second operand 5 states. [2018-11-18 12:05:04,521 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 18 states and 21 transitions. cyclomatic complexity: 5. Second operand 5 states. Result 35 states and 40 transitions. Complement of second has 7 states. [2018-11-18 12:05:04,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 12:05:04,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:05:04,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2018-11-18 12:05:04,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 6 letters. [2018-11-18 12:05:04,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:05:04,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 6 letters. [2018-11-18 12:05:04,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:05:04,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 5 letters. Loop has 12 letters. [2018-11-18 12:05:04,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:05:04,525 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 40 transitions. [2018-11-18 12:05:04,525 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:05:04,526 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 29 states and 33 transitions. [2018-11-18 12:05:04,526 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 12:05:04,526 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 18 [2018-11-18 12:05:04,526 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 33 transitions. [2018-11-18 12:05:04,526 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:05:04,527 INFO L705 BuchiCegarLoop]: Abstraction has 29 states and 33 transitions. [2018-11-18 12:05:04,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states and 33 transitions. [2018-11-18 12:05:04,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2018-11-18 12:05:04,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-18 12:05:04,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2018-11-18 12:05:04,531 INFO L728 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-18 12:05:04,531 INFO L608 BuchiCegarLoop]: Abstraction has 27 states and 31 transitions. [2018-11-18 12:05:04,531 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 12:05:04,531 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 31 transitions. [2018-11-18 12:05:04,531 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 12:05:04,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:05:04,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:05:04,532 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 12:05:04,532 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:05:04,532 INFO L794 eck$LassoCheckResult]: Stem: 758#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 750#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~nondet20, main_#t~ret21;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet18, main_#t~nondet19, main_#t~nondet20;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~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~mem15, test_fun_#t~mem16, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~z, 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_~z_ref~0.base, test_fun_~z_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;test_fun_~z := test_fun_#in~z;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_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.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(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 751#L561-2 assume true; 766#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 776#L557-2 assume !test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 770#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 768#L558 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem15 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 764#L561 assume test_fun_#t~mem14 > test_fun_#t~mem15;havoc test_fun_#t~mem14;havoc test_fun_#t~mem15;call test_fun_#t~mem16 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem16 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem16; 765#L561-2 assume true; 759#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 760#L557-2 assume test_fun_#t~short10; 752#L557-4 [2018-11-18 12:05:04,532 INFO L796 eck$LassoCheckResult]: Loop: 752#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 753#L558 assume test_fun_#t~mem11 > test_fun_#t~mem12;havoc test_fun_#t~mem12;havoc test_fun_#t~mem11;call test_fun_#t~mem13 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem13 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem13; 756#L561-2 assume true; 774#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 772#L557-2 assume test_fun_#t~short10; 752#L557-4 [2018-11-18 12:05:04,533 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:04,533 INFO L82 PathProgramCache]: Analyzing trace with hash 2053386331, now seen corresponding path program 1 times [2018-11-18 12:05:04,533 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:04,533 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:04,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:04,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:04,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:05:04,624 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:05:04,625 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-18 12:05:04,625 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c0910c56-5b84-4cce-bcd3-38c8543dd003/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 12:05:04,642 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:04,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:05:04,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:05:04,689 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:04,691 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 12:05:04,716 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:04,717 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:04,718 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 12:05:04,719 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:04,726 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:05:04,732 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:05:04,732 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:13 [2018-11-18 12:05:04,833 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:04,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 46 [2018-11-18 12:05:04,841 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:05:04,842 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2018-11-18 12:05:04,843 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:05:04,872 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:05:04,878 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 12:05:04,879 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:41, output treesize:16 [2018-11-18 12:05:04,893 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:05:04,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-18 12:05:04,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2018-11-18 12:05:04,922 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 12:05:04,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:05:04,922 INFO L82 PathProgramCache]: Analyzing trace with hash 46837477, now seen corresponding path program 2 times [2018-11-18 12:05:04,922 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:05:04,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:05:04,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:04,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:05:04,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:05:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:04,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:05:05,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-18 12:05:05,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-11-18 12:05:05,048 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. cyclomatic complexity: 7 Second operand 11 states. [2018-11-18 12:05:05,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 12:05:05,088 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2018-11-18 12:05:05,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 12:05:05,089 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2018-11-18 12:05:05,089 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:05:05,089 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2018-11-18 12:05:05,089 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:05:05,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:05:05,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:05:05,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:05:05,090 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:05:05,090 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:05:05,090 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:05:05,090 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 12:05:05,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:05:05,090 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:05:05,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:05:05,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:05:05 BoogieIcfgContainer [2018-11-18 12:05:05,094 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:05:05,095 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:05:05,095 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:05:05,095 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:05:05,095 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:04:57" (3/4) ... [2018-11-18 12:05:05,098 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:05:05,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:05:05,098 INFO L168 Benchmark]: Toolchain (without parser) took 8145.26 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 390.6 MB). Free memory was 956.4 MB in the beginning and 1.3 GB in the end (delta: -392.0 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:05:05,099 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:05:05,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 415.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -233.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:05:05,100 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. [2018-11-18 12:05:05,100 INFO L168 Benchmark]: Boogie Preprocessor took 22.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:05:05,100 INFO L168 Benchmark]: RCFGBuilder took 263.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. [2018-11-18 12:05:05,101 INFO L168 Benchmark]: BuchiAutomizer took 7401.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -187.4 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:05:05,101 INFO L168 Benchmark]: Witness Printer took 3.32 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:05:05,104 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 415.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 198.7 MB). Free memory was 956.4 MB in the beginning and 1.2 GB in the end (delta: -233.7 MB). Peak memory consumption was 30.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 36.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.2 MB). Peak memory consumption was 6.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 22.66 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 263.33 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 22.8 MB). Peak memory consumption was 22.8 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7401.49 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 191.9 MB). Free memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: -187.4 MB). Peak memory consumption was 4.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.32 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 6 terminating modules (4 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[x_ref][x_ref] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 4 locations. 4 modules have a trivial ranking function, the largest among these consists of 11 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.3s and 7 iterations. TraceHistogramMax:2. Analysis of lassos took 6.4s. Construction of modules took 0.1s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 25 StatesRemovedByMinimization, 3 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 34 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 50 SDtfs, 72 SDslu, 57 SDs, 0 SdLazy, 141 SolverSat, 17 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital623 mio100 ax103 hnf99 lsp73 ukn70 mio100 lsp30 div100 bol104 ite100 ukn100 eq182 hnf88 smp96 dnf231 smp73 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 240ms VariablesStem: 17 VariablesLoop: 12 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...