./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.15-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_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/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 7464e7c5283b85fe14cc907bcd5d5339a700ef74 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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 09:52:33,026 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 09:52:33,027 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 09:52:33,034 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 09:52:33,034 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 09:52:33,035 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 09:52:33,035 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 09:52:33,036 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 09:52:33,037 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 09:52:33,038 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 09:52:33,039 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 09:52:33,039 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 09:52:33,039 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 09:52:33,040 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 09:52:33,041 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 09:52:33,041 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 09:52:33,042 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 09:52:33,043 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 09:52:33,044 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 09:52:33,045 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 09:52:33,046 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 09:52:33,047 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 09:52:33,048 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 09:52:33,049 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 09:52:33,049 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 09:52:33,049 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 09:52:33,050 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 09:52:33,051 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 09:52:33,051 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 09:52:33,052 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 09:52:33,052 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 09:52:33,052 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 09:52:33,053 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 09:52:33,053 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 09:52:33,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 09:52:33,054 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 09:52:33,054 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 09:52:33,064 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 09:52:33,065 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 09:52:33,066 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 09:52:33,066 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 09:52:33,066 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 09:52:33,066 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 09:52:33,066 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 09:52:33,066 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 09:52:33,066 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 09:52:33,067 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 09:52:33,067 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 09:52:33,067 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 09:52:33,067 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 09:52:33,067 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 09:52:33,067 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 09:52:33,067 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 09:52:33,067 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 09:52:33,067 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 09:52:33,067 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 09:52:33,068 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 09:52:33,068 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 09:52:33,068 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 09:52:33,068 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 09:52:33,068 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 09:52:33,068 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 09:52:33,068 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 09:52:33,068 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 09:52:33,068 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 09:52:33,069 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 09:52:33,069 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_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/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 -> 7464e7c5283b85fe14cc907bcd5d5339a700ef74 [2018-11-18 09:52:33,089 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 09:52:33,097 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 09:52:33,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 09:52:33,100 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 09:52:33,100 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 09:52:33,100 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-18 09:52:33,135 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/bin-2019/uautomizer/data/82d967ca5/dab3eb379ecd4990b4a2be1e792be775/FLAG1c3824ee8 [2018-11-18 09:52:33,504 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 09:52:33,505 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/sv-benchmarks/c/termination-memory-alloca/b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-18 09:52:33,515 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/bin-2019/uautomizer/data/82d967ca5/dab3eb379ecd4990b4a2be1e792be775/FLAG1c3824ee8 [2018-11-18 09:52:33,894 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/bin-2019/uautomizer/data/82d967ca5/dab3eb379ecd4990b4a2be1e792be775 [2018-11-18 09:52:33,896 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 09:52:33,896 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 09:52:33,897 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 09:52:33,897 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 09:52:33,900 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 09:52:33,901 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:52:33" (1/1) ... [2018-11-18 09:52:33,903 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@702a538c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:33, skipping insertion in model container [2018-11-18 09:52:33,903 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 09:52:33" (1/1) ... [2018-11-18 09:52:33,908 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 09:52:33,937 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 09:52:34,113 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:52:34,121 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 09:52:34,150 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 09:52:34,223 INFO L195 MainTranslator]: Completed translation [2018-11-18 09:52:34,223 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34 WrapperNode [2018-11-18 09:52:34,224 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 09:52:34,224 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 09:52:34,224 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 09:52:34,224 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 09:52:34,231 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (1/1) ... [2018-11-18 09:52:34,239 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (1/1) ... [2018-11-18 09:52:34,252 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 09:52:34,252 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 09:52:34,252 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 09:52:34,252 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 09:52:34,258 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (1/1) ... [2018-11-18 09:52:34,258 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (1/1) ... [2018-11-18 09:52:34,260 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (1/1) ... [2018-11-18 09:52:34,260 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (1/1) ... [2018-11-18 09:52:34,262 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (1/1) ... [2018-11-18 09:52:34,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (1/1) ... [2018-11-18 09:52:34,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (1/1) ... [2018-11-18 09:52:34,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 09:52:34,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 09:52:34,267 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 09:52:34,267 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 09:52:34,268 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_a6a46222-4fa7-49f4-863d-9b0d1e79ccab/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 09:52:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 09:52:34,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 09:52:34,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 09:52:34,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 09:52:34,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 09:52:34,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 09:52:34,471 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 09:52:34,471 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:52:34 BoogieIcfgContainer [2018-11-18 09:52:34,472 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 09:52:34,472 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 09:52:34,472 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 09:52:34,475 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 09:52:34,476 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:52:34,476 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 09:52:33" (1/3) ... [2018-11-18 09:52:34,477 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12b48cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:52:34, skipping insertion in model container [2018-11-18 09:52:34,477 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:52:34,477 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 09:52:34" (2/3) ... [2018-11-18 09:52:34,478 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@12b48cfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 09:52:34, skipping insertion in model container [2018-11-18 09:52:34,478 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 09:52:34,478 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:52:34" (3/3) ... [2018-11-18 09:52:34,479 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.15-alloca_true-termination_true-no-overflow.c.i [2018-11-18 09:52:34,517 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 09:52:34,517 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 09:52:34,517 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 09:52:34,517 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 09:52:34,517 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 09:52:34,518 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 09:52:34,518 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 09:52:34,518 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 09:52:34,518 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 09:52:34,526 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 09:52:34,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:52:34,541 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:52:34,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:52:34,545 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:52:34,545 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 09:52:34,545 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 09:52:34,545 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 09:52:34,546 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:52:34,546 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:52:34,546 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:52:34,546 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:52:34,546 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 09:52:34,551 INFO L794 eck$LassoCheckResult]: Stem: 12#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, 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); 10#L558-5true [2018-11-18 09:52:34,552 INFO L796 eck$LassoCheckResult]: Loop: 10#L558-5true assume true; 4#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_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 7#L557-2true assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_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; 11#L557-4true assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem9; 8#L558-4true assume !true; 10#L558-5true [2018-11-18 09:52:34,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 09:52:34,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:34,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:34,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:34,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:52:34,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:34,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:34,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:34,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:34,670 INFO L82 PathProgramCache]: Analyzing trace with hash 34419797, now seen corresponding path program 1 times [2018-11-18 09:52:34,671 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:34,671 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:34,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:34,672 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:52:34,672 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:34,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:34,694 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 09:52:34,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:52:34,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2018-11-18 09:52:34,698 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:52:34,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-18 09:52:34,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-18 09:52:34,708 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-11-18 09:52:34,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:52:34,712 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-18 09:52:34,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-18 09:52:34,714 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-18 09:52:34,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:52:34,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2018-11-18 09:52:34,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:52:34,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:52:34,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-11-18 09:52:34,720 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:52:34,720 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-18 09:52:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-11-18 09:52:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-11-18 09:52:34,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-11-18 09:52:34,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-11-18 09:52:34,744 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-18 09:52:34,744 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-11-18 09:52:34,744 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 09:52:34,744 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-11-18 09:52:34,745 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-11-18 09:52:34,745 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:52:34,745 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:52:34,745 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:52:34,745 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 09:52:34,746 INFO L794 eck$LassoCheckResult]: Stem: 41#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, 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); 37#L558-5 [2018-11-18 09:52:34,746 INFO L796 eck$LassoCheckResult]: Loop: 37#L558-5 assume true; 38#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_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 44#L557-2 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_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; 39#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem9; 40#L558-4 assume true; 42#L558-1 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 43#L558-2 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11; 37#L558-5 [2018-11-18 09:52:34,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:34,746 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-18 09:52:34,746 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:34,746 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:34,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:52:34,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:34,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:34,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:34,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:34,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1282321297, now seen corresponding path program 1 times [2018-11-18 09:52:34,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:34,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:34,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:34,780 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:52:34,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:34,855 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 09:52:34,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:52:34,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 09:52:34,856 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 09:52:34,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-18 09:52:34,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-18 09:52:34,857 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-18 09:52:34,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:52:34,970 INFO L93 Difference]: Finished difference Result 14 states and 16 transitions. [2018-11-18 09:52:34,970 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 09:52:34,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 16 transitions. [2018-11-18 09:52:34,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 09:52:34,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 14 states and 16 transitions. [2018-11-18 09:52:34,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2018-11-18 09:52:34,972 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 14 [2018-11-18 09:52:34,972 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 16 transitions. [2018-11-18 09:52:34,973 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:52:34,973 INFO L705 BuchiCegarLoop]: Abstraction has 14 states and 16 transitions. [2018-11-18 09:52:34,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 16 transitions. [2018-11-18 09:52:34,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2018-11-18 09:52:34,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-18 09:52:34,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 14 transitions. [2018-11-18 09:52:34,974 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 09:52:34,974 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 14 transitions. [2018-11-18 09:52:34,975 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 09:52:34,975 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 14 transitions. [2018-11-18 09:52:34,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-11-18 09:52:34,975 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:52:34,975 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:52:34,976 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 09:52:34,976 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 09:52:34,976 INFO L794 eck$LassoCheckResult]: Stem: 79#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 74#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, 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); 75#L558-5 [2018-11-18 09:52:34,976 INFO L796 eck$LassoCheckResult]: Loop: 75#L558-5 assume true; 76#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_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 84#L557-2 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_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; 77#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem9; 78#L558-4 assume true; 85#L558-1 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 82#L558-2 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;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 83#L558-4 assume true; 80#L558-1 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 81#L558-2 assume !(test_fun_#t~mem11 > test_fun_#t~mem12);havoc test_fun_#t~mem12;havoc test_fun_#t~mem11; 75#L558-5 [2018-11-18 09:52:34,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-18 09:52:34,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:34,977 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:34,978 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:52:34,978 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:35,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:35,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2100421481, now seen corresponding path program 1 times [2018-11-18 09:52:35,003 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:35,003 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:35,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:35,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:52:35,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:35,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:35,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:35,026 INFO L82 PathProgramCache]: Analyzing trace with hash 10067115, now seen corresponding path program 1 times [2018-11-18 09:52:35,026 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:35,026 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:35,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:35,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:52:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:35,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:35,227 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 74 [2018-11-18 09:52:35,538 WARN L180 SmtUtils]: Spent 267.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-18 09:52:35,645 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-18 09:52:35,653 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:52:35,653 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:52:35,653 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:52:35,653 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:52:35,654 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:52:35,654 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:52:35,654 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:52:35,654 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:52:35,654 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-11-18 09:52:35,654 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:52:35,654 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:52:35,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:35,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:35,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:35,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:35,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:35,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:35,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:35,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:35,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:35,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:35,686 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 09:52:36,005 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 93 [2018-11-18 09:52:36,106 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 09:52:36,107 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 09:52:36,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:36,110 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 09:52:36,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:36,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:36,115 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 09:52:36,117 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 09:52:36,119 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 09:52:36,454 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:52:36,458 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:52:36,459 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 09:52:36,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:36,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,461 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:36,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:36,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:52:36,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:36,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,465 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,465 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:36,465 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:36,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,466 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 09:52:36,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:36,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,468 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:36,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:36,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,470 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 09:52:36,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:36,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,471 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:36,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:36,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,472 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 09:52:36,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:36,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:36,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:36,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,474 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 09:52:36,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:36,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:36,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,480 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 09:52:36,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:36,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:36,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:36,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,485 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 09:52:36,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:36,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,485 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,486 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:36,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:36,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,487 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 09:52:36,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,487 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:36,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:36,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,492 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 09:52:36,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,493 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:36,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:36,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,499 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 09:52:36,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:36,501 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:36,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,504 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 09:52:36,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,506 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:36,506 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:36,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:36,511 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 09:52:36,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:36,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:36,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:36,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:36,515 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:36,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:36,534 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:52:36,558 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 09:52:36,558 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 09:52:36,560 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:52:36,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:52:36,562 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:52:36,562 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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_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_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2018-11-18 09:52:36,675 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-11-18 09:52:36,679 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:52:36,680 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:52:36,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:36,700 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:52:36,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:36,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:52:36,746 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2018-11-18 09:52:36,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2018-11-18 09:52:36,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 09:52:36,759 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2018-11-18 09:52:36,759 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 09:52:36,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2018-11-18 09:52:36,776 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-11-18 09:52:36,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 3 dim-1 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:52:36,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 09:52:36,812 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 1 variables, input treesize:30, output treesize:28 [2018-11-18 09:52:36,857 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 09:52:36,859 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 09:52:36,860 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3 Second operand 6 states. [2018-11-18 09:52:37,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 14 transitions. cyclomatic complexity: 3. Second operand 6 states. Result 22 states and 27 transitions. Complement of second has 10 states. [2018-11-18 09:52:37,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 09:52:37,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 09:52:37,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-18 09:52:37,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-18 09:52:37,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:52:37,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 12 letters. Loop has 10 letters. [2018-11-18 09:52:37,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:52:37,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 2 letters. Loop has 20 letters. [2018-11-18 09:52:37,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:52:37,009 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 22 states and 27 transitions. [2018-11-18 09:52:37,010 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:52:37,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 22 states to 22 states and 27 transitions. [2018-11-18 09:52:37,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2018-11-18 09:52:37,011 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2018-11-18 09:52:37,011 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 27 transitions. [2018-11-18 09:52:37,011 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:52:37,011 INFO L705 BuchiCegarLoop]: Abstraction has 22 states and 27 transitions. [2018-11-18 09:52:37,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states and 27 transitions. [2018-11-18 09:52:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 19. [2018-11-18 09:52:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 09:52:37,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2018-11-18 09:52:37,013 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 09:52:37,013 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 24 transitions. [2018-11-18 09:52:37,013 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 09:52:37,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 24 transitions. [2018-11-18 09:52:37,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:52:37,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:52:37,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:52:37,014 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:52:37,014 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:52:37,014 INFO L794 eck$LassoCheckResult]: Stem: 335#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 326#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, 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); 327#L558-5 assume true; 329#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_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 341#L557-2 assume !test_fun_#t~short10; 331#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem9; 332#L558-4 [2018-11-18 09:52:37,014 INFO L796 eck$LassoCheckResult]: Loop: 332#L558-4 assume true; 336#L558-1 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 337#L558-2 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;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 332#L558-4 [2018-11-18 09:52:37,014 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:37,020 INFO L82 PathProgramCache]: Analyzing trace with hash 889537579, now seen corresponding path program 1 times [2018-11-18 09:52:37,020 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:37,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:37,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:37,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:52:37,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:37,035 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 09:52:37,036 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 09:52:37,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 09:52:37,036 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 09:52:37,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:37,036 INFO L82 PathProgramCache]: Analyzing trace with hash 52699, now seen corresponding path program 1 times [2018-11-18 09:52:37,036 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:37,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:37,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:52:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:37,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:37,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:37,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 09:52:37,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 09:52:37,119 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. cyclomatic complexity: 7 Second operand 3 states. [2018-11-18 09:52:37,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 09:52:37,125 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2018-11-18 09:52:37,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 09:52:37,125 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 24 transitions. [2018-11-18 09:52:37,126 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:52:37,126 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 19 states and 22 transitions. [2018-11-18 09:52:37,126 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-11-18 09:52:37,126 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 09:52:37,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 22 transitions. [2018-11-18 09:52:37,127 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 09:52:37,127 INFO L705 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 09:52:37,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states and 22 transitions. [2018-11-18 09:52:37,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-11-18 09:52:37,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-18 09:52:37,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2018-11-18 09:52:37,128 INFO L728 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 09:52:37,128 INFO L608 BuchiCegarLoop]: Abstraction has 19 states and 22 transitions. [2018-11-18 09:52:37,128 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 09:52:37,129 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 22 transitions. [2018-11-18 09:52:37,129 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-18 09:52:37,129 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 09:52:37,129 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 09:52:37,129 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-18 09:52:37,129 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-18 09:52:37,129 INFO L794 eck$LassoCheckResult]: Stem: 381#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 372#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet16, main_#t~nondet17, main_#t~nondet18, main_#t~ret19;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet16, main_#t~nondet17, main_#t~nondet18;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~mem13, test_fun_#t~mem14, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem15, 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); 373#L558-5 assume true; 375#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_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short10 := test_fun_#t~mem6 == test_fun_#t~mem7; 386#L557-2 assume test_fun_#t~short10;call test_fun_#t~mem8 := read~int(test_fun_~x_ref~0.base, test_fun_~x_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; 377#L557-4 assume !!test_fun_#t~short10;havoc test_fun_#t~mem7;havoc test_fun_#t~mem6;havoc test_fun_#t~mem8;havoc test_fun_#t~short10;havoc test_fun_#t~mem9; 378#L558-4 [2018-11-18 09:52:37,130 INFO L796 eck$LassoCheckResult]: Loop: 378#L558-4 assume true; 382#L558-1 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call test_fun_#t~mem12 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 383#L558-2 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;call test_fun_#t~mem14 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem14 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem14; 378#L558-4 [2018-11-18 09:52:37,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:37,130 INFO L82 PathProgramCache]: Analyzing trace with hash 889537517, now seen corresponding path program 1 times [2018-11-18 09:52:37,130 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:37,130 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:37,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:37,131 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:52:37,131 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:37,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:37,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:37,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:37,152 INFO L82 PathProgramCache]: Analyzing trace with hash 52699, now seen corresponding path program 2 times [2018-11-18 09:52:37,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:37,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:37,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 09:52:37,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:37,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:37,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:37,161 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:37,161 INFO L82 PathProgramCache]: Analyzing trace with hash 263975535, now seen corresponding path program 1 times [2018-11-18 09:52:37,161 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 09:52:37,161 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 09:52:37,162 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:37,164 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 09:52:37,164 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 09:52:37,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 09:52:37,608 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 120 [2018-11-18 09:52:37,735 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 108 [2018-11-18 09:52:37,737 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 09:52:37,737 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 09:52:37,737 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 09:52:37,738 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 09:52:37,738 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 09:52:37,738 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 09:52:37,738 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 09:52:37,738 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 09:52:37,738 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.15-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-11-18 09:52:37,738 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 09:52:37,738 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 09:52:37,742 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 09:52:37,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 09:52:37,747 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 09:52:37,749 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 09:52:37,750 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 09:52:37,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 09:52:37,752 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 09:52:37,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 09:52:37,754 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 09:52:37,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 09:52:37,756 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 09:52:38,019 WARN L180 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 97 [2018-11-18 09:52:38,099 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 09:52:38,100 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 09:52:38,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:38,102 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 09:52:38,104 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 09:52:38,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 09:52:38,106 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 09:52:38,107 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 09:52:38,448 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 09:52:38,448 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 09:52:38,449 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 09:52:38,449 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,449 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:38,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,449 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:38,450 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:38,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:52:38,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,450 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:38,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,451 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:38,451 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:38,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:52:38,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,452 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,453 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:52:38,454 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:38,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,455 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,455 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:38,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:38,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,455 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 09:52:38,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:38,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,456 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:38,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:38,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 09:52:38,457 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,457 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,458 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,459 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 09:52:38,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:38,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,459 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,460 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:38,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:38,460 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,460 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 09:52:38,460 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:38,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,461 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,461 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:38,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:38,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,461 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 09:52:38,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:38,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,462 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:38,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:38,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,462 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 09:52:38,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 09:52:38,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,463 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,463 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 09:52:38,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 09:52:38,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,463 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 09:52:38,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,464 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,464 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,465 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 09:52:38,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,466 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:52:38,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,466 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:52:38,467 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,470 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 09:52:38,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,471 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:52:38,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,472 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:52:38,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,476 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 09:52:38,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,481 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 09:52:38,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,487 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 09:52:38,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,504 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 09:52:38,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,510 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 09:52:38,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,513 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 09:52:38,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,514 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,516 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 09:52:38,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,516 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:52:38,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,516 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,517 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:52:38,517 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,524 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 09:52:38,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,525 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,525 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,526 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,530 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 09:52:38,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,532 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,532 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,535 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 09:52:38,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,536 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 09:52:38,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,536 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,537 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 09:52:38,537 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 09:52:38,540 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 09:52:38,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 09:52:38,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 09:52:38,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 09:52:38,541 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 09:52:38,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 09:52:38,543 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 09:52:38,555 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 09:52:38,565 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 09:52:38,565 INFO L444 ModelExtractionUtils]: 32 out of 40 variables were initially zero. Simplification set additionally 5 variables to zero. [2018-11-18 09:52:38,565 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 09:52:38,566 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 09:52:38,566 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 09:52:38,566 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)_2, 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 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_2 Supporting invariants [] [2018-11-18 09:52:38,692 INFO L297 tatePredicateManager]: 39 out of 41 supporting invariants were superfluous and have been removed [2018-11-18 09:52:38,695 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:52:38,696 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 09:52:38,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 09:52:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:38,722 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:52:38,737 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:52:38,738 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 09:52:38,739 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2018-11-18 09:52:38,743 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 09:52:38,750 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 09:52:38,751 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:27, output treesize:17 [2018-11-18 09:52:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 09:52:38,769 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 09:52:38,811 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 09:52:38,812 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 2 loop predicates [2018-11-18 09:52:38,812 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5 Second operand 6 states. [2018-11-18 09:52:38,885 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 22 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 44 states and 50 transitions. Complement of second has 8 states. [2018-11-18 09:52:38,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 3 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 09:52:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 09:52:38,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 15 transitions. [2018-11-18 09:52:38,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 6 letters. Loop has 3 letters. [2018-11-18 09:52:38,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:52:38,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 9 letters. Loop has 3 letters. [2018-11-18 09:52:38,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:52:38,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 15 transitions. Stem has 6 letters. Loop has 6 letters. [2018-11-18 09:52:38,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 09:52:38,887 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 44 states and 50 transitions. [2018-11-18 09:52:38,888 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:52:38,888 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 44 states to 0 states and 0 transitions. [2018-11-18 09:52:38,889 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 09:52:38,889 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 09:52:38,889 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 09:52:38,889 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 09:52:38,889 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:52:38,889 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:52:38,889 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 09:52:38,889 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 09:52:38,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 09:52:38,889 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 09:52:38,889 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 09:52:38,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 09:52:38 BoogieIcfgContainer [2018-11-18 09:52:38,897 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 09:52:38,897 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 09:52:38,897 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 09:52:38,898 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 09:52:38,898 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 09:52:34" (3/4) ... [2018-11-18 09:52:38,901 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 09:52:38,901 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 09:52:38,902 INFO L168 Benchmark]: Toolchain (without parser) took 5005.58 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.8 MB). Free memory was 955.5 MB in the beginning and 1.0 GB in the end (delta: -53.2 MB). Peak memory consumption was 137.6 MB. Max. memory is 11.5 GB. [2018-11-18 09:52:38,902 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:52:38,903 INFO L168 Benchmark]: CACSL2BoogieTranslator took 326.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. [2018-11-18 09:52:38,903 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:52:38,904 INFO L168 Benchmark]: Boogie Preprocessor took 15.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 09:52:38,904 INFO L168 Benchmark]: RCFGBuilder took 204.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. [2018-11-18 09:52:38,904 INFO L168 Benchmark]: BuchiAutomizer took 4425.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.6 MB). Peak memory consumption was 155.8 MB. Max. memory is 11.5 GB. [2018-11-18 09:52:38,906 INFO L168 Benchmark]: Witness Printer took 3.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 09:52:38,909 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 326.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 131.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -175.0 MB). Peak memory consumption was 38.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.58 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.10 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 204.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4425.01 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 59.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 96.6 MB). Peak memory consumption was 155.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.49 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 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 5 terminating modules (3 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[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[z_ref][z_ref] + unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. 3 modules have a trivial ranking function, the largest among these consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.3s and 6 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.1s. Büchi inclusion checks took 0.5s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 2. Automata minimization 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 19 states and ocurred in iteration 3. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/3 HoareTripleCheckerStatistics: 47 SDtfs, 29 SDslu, 41 SDs, 0 SdLazy, 64 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT0 SILN0 SILU1 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital431 mio100 ax104 hnf100 lsp94 ukn52 mio100 lsp34 div100 bol100 ite100 ukn100 eq191 hnf88 smp97 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 4ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...