./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/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 b4afea49cf97a69d20f4a5a7301b61ef07ffc206 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 09:22:02,470 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 09:22:02,471 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 09:22:02,476 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 09:22:02,476 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 09:22:02,477 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 09:22:02,477 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 09:22:02,478 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 09:22:02,479 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 09:22:02,479 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 09:22:02,480 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 09:22:02,480 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 09:22:02,480 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 09:22:02,480 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 09:22:02,481 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 09:22:02,481 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 09:22:02,482 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 09:22:02,482 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 09:22:02,483 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 09:22:02,484 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 09:22:02,484 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 09:22:02,485 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 09:22:02,486 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 09:22:02,486 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 09:22:02,486 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 09:22:02,487 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 09:22:02,487 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 09:22:02,487 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 09:22:02,488 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 09:22:02,488 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 09:22:02,488 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 09:22:02,489 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 09:22:02,489 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 09:22:02,489 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 09:22:02,489 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 09:22:02,490 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 09:22:02,490 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 09:22:02,497 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 09:22:02,497 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 09:22:02,498 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 09:22:02,498 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 09:22:02,498 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 09:22:02,498 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 09:22:02,498 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 09:22:02,498 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 09:22:02,498 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 09:22:02,498 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 09:22:02,498 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 09:22:02,499 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 09:22:02,499 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 09:22:02,499 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 09:22:02,499 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 09:22:02,499 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 09:22:02,499 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 09:22:02,499 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 09:22:02,499 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 09:22:02,499 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 09:22:02,499 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 09:22:02,499 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 09:22:02,499 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 09:22:02,500 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 09:22:02,500 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 09:22:02,500 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 09:22:02,500 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 09:22:02,500 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 09:22:02,500 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 09:22:02,500 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_1b90ae53-fca2-4746-9355-d36b79c7b188/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 -> b4afea49cf97a69d20f4a5a7301b61ef07ffc206 [2018-12-08 09:22:02,517 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 09:22:02,523 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 09:22:02,525 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 09:22:02,526 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 09:22:02,526 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 09:22:02,526 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-08 09:22:02,559 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/data/ddd9da230/719aab7ad68c400e8b5dd79e3fa7550e/FLAG6aad1863c [2018-12-08 09:22:02,890 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 09:22:02,891 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/sv-benchmarks/c/termination-memory-alloca/c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-08 09:22:02,897 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/data/ddd9da230/719aab7ad68c400e8b5dd79e3fa7550e/FLAG6aad1863c [2018-12-08 09:22:02,905 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/data/ddd9da230/719aab7ad68c400e8b5dd79e3fa7550e [2018-12-08 09:22:02,907 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 09:22:02,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 09:22:02,908 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 09:22:02,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 09:22:02,910 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 09:22:02,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:22:02" (1/1) ... [2018-12-08 09:22:02,913 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e9d864a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:02, skipping insertion in model container [2018-12-08 09:22:02,913 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 09:22:02" (1/1) ... [2018-12-08 09:22:02,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 09:22:02,935 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 09:22:03,073 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:22:03,079 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 09:22:03,138 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 09:22:03,157 INFO L195 MainTranslator]: Completed translation [2018-12-08 09:22:03,157 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03 WrapperNode [2018-12-08 09:22:03,157 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 09:22:03,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 09:22:03,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 09:22:03,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 09:22:03,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (1/1) ... [2018-12-08 09:22:03,171 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (1/1) ... [2018-12-08 09:22:03,182 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 09:22:03,182 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 09:22:03,182 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 09:22:03,182 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 09:22:03,188 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (1/1) ... [2018-12-08 09:22:03,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (1/1) ... [2018-12-08 09:22:03,189 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (1/1) ... [2018-12-08 09:22:03,189 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (1/1) ... [2018-12-08 09:22:03,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (1/1) ... [2018-12-08 09:22:03,194 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (1/1) ... [2018-12-08 09:22:03,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (1/1) ... [2018-12-08 09:22:03,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 09:22:03,196 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 09:22:03,196 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 09:22:03,196 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 09:22:03,197 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:22:03,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 09:22:03,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 09:22:03,228 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 09:22:03,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 09:22:03,228 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 09:22:03,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 09:22:03,350 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 09:22:03,350 INFO L280 CfgBuilder]: Removed 8 assue(true) statements. [2018-12-08 09:22:03,350 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:22:03 BoogieIcfgContainer [2018-12-08 09:22:03,350 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 09:22:03,351 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 09:22:03,351 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 09:22:03,353 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 09:22:03,353 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:22:03,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 09:22:02" (1/3) ... [2018-12-08 09:22:03,354 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d715273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:22:03, skipping insertion in model container [2018-12-08 09:22:03,354 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:22:03,354 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 09:22:03" (2/3) ... [2018-12-08 09:22:03,355 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2d715273 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 09:22:03, skipping insertion in model container [2018-12-08 09:22:03,355 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 09:22:03,355 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:22:03" (3/3) ... [2018-12-08 09:22:03,356 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.01_assume-alloca_true-termination_true-no-overflow.c.i [2018-12-08 09:22:03,386 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 09:22:03,387 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 09:22:03,387 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 09:22:03,387 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 09:22:03,387 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 09:22:03,387 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 09:22:03,387 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 09:22:03,387 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 09:22:03,387 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 09:22:03,395 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-08 09:22:03,407 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 09:22:03,408 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:03,408 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:03,411 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:22:03,412 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:22:03,412 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 09:22:03,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-12-08 09:22:03,412 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 09:22:03,412 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:03,413 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:03,413 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:22:03,413 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:22:03,417 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6#L-1true havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 12#L553-3true [2018-12-08 09:22:03,418 INFO L796 eck$LassoCheckResult]: Loop: 12#L553-3true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 9#L553-1true assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 13#L555-5true assume !true; 16#L555-6true call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 12#L553-3true [2018-12-08 09:22:03,421 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:03,421 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 09:22:03,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:03,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:03,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:03,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:03,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:03,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1144712, now seen corresponding path program 1 times [2018-12-08 09:22:03,501 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:03,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:03,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:03,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:03,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:22:03,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 09:22:03,525 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 09:22:03,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-08 09:22:03,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-08 09:22:03,535 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 2 states. [2018-12-08 09:22:03,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:22:03,538 INFO L93 Difference]: Finished difference Result 14 states and 17 transitions. [2018-12-08 09:22:03,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-08 09:22:03,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 14 states and 17 transitions. [2018-12-08 09:22:03,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 09:22:03,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 14 states to 9 states and 11 transitions. [2018-12-08 09:22:03,543 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 9 [2018-12-08 09:22:03,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-12-08 09:22:03,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 11 transitions. [2018-12-08 09:22:03,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:22:03,544 INFO L705 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-08 09:22:03,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states and 11 transitions. [2018-12-08 09:22:03,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-12-08 09:22:03,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-12-08 09:22:03,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 11 transitions. [2018-12-08 09:22:03,560 INFO L728 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-08 09:22:03,560 INFO L608 BuchiCegarLoop]: Abstraction has 9 states and 11 transitions. [2018-12-08 09:22:03,560 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 09:22:03,560 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 9 states and 11 transitions. [2018-12-08 09:22:03,560 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 09:22:03,560 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:03,560 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:03,560 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:22:03,560 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:22:03,561 INFO L794 eck$LassoCheckResult]: Stem: 38#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 36#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 37#L553-3 [2018-12-08 09:22:03,561 INFO L796 eck$LassoCheckResult]: Loop: 37#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 39#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 40#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 44#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 41#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 42#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 37#L553-3 [2018-12-08 09:22:03,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:03,561 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-08 09:22:03,561 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:03,561 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:03,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,562 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:03,562 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:03,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:03,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:03,576 INFO L82 PathProgramCache]: Analyzing trace with hash 1099516500, now seen corresponding path program 1 times [2018-12-08 09:22:03,576 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:03,577 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:03,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,577 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:03,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:03,627 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 09:22:03,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 09:22:03,627 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 09:22:03,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 09:22:03,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-12-08 09:22:03,627 INFO L87 Difference]: Start difference. First operand 9 states and 11 transitions. cyclomatic complexity: 3 Second operand 5 states. [2018-12-08 09:22:03,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:22:03,675 INFO L93 Difference]: Finished difference Result 17 states and 21 transitions. [2018-12-08 09:22:03,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 09:22:03,675 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 21 transitions. [2018-12-08 09:22:03,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-12-08 09:22:03,676 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 21 transitions. [2018-12-08 09:22:03,676 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-12-08 09:22:03,677 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-12-08 09:22:03,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 21 transitions. [2018-12-08 09:22:03,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:22:03,677 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 21 transitions. [2018-12-08 09:22:03,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 21 transitions. [2018-12-08 09:22:03,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-12-08 09:22:03,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-08 09:22:03,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-12-08 09:22:03,678 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-12-08 09:22:03,678 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-12-08 09:22:03,678 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 09:22:03,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-12-08 09:22:03,678 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-08 09:22:03,678 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:03,678 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:03,679 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 09:22:03,679 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 09:22:03,679 INFO L794 eck$LassoCheckResult]: Stem: 74#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 72#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 73#L553-3 [2018-12-08 09:22:03,679 INFO L796 eck$LassoCheckResult]: Loop: 73#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 75#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 76#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 80#L555-1 assume !test_fun_#t~short8; 83#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 81#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 73#L553-3 [2018-12-08 09:22:03,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:03,679 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-08 09:22:03,679 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:03,679 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:03,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,680 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:03,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:03,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:03,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:03,698 INFO L82 PathProgramCache]: Analyzing trace with hash 1099518422, now seen corresponding path program 1 times [2018-12-08 09:22:03,699 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:03,699 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:03,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,700 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:03,700 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:03,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:03,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:03,712 INFO L82 PathProgramCache]: Analyzing trace with hash 179567640, now seen corresponding path program 1 times [2018-12-08 09:22:03,713 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:03,713 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:03,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,713 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:03,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:03,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:03,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:03,969 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:22:03,970 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:22:03,970 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:22:03,970 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:22:03,970 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:22:03,970 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:22:03,970 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:22:03,970 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:22:03,970 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration3_Lasso [2018-12-08 09:22:03,970 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:22:03,971 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:22:03,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:03,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:04,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:04,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:04,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:04,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:04,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:04,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:04,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:04,377 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:22:04,382 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:22:04,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,385 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,385 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,385 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,385 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,387 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,389 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,391 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,391 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,393 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,393 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,394 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,396 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,396 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,400 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:04,400 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:04,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,403 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,404 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,407 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,409 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:04,409 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:04,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,413 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,413 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,414 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:04,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:04,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,422 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,424 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,426 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:04,426 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,426 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,426 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,427 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:04,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:04,427 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,428 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:22:04,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,428 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,430 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:22:04,430 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:04,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,439 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:04,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:04,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,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-12-08 09:22:04,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:04,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:04,463 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,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-12-08 09:22:04,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,464 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,464 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,464 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,465 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:04,465 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:04,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:04,473 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:04,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,476 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:22:04,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,477 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:22:04,477 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:04,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:04,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:04,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:04,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:04,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:04,484 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:04,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:04,485 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:04,491 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:22:04,495 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:22:04,495 INFO L444 ModelExtractionUtils]: 13 out of 16 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-12-08 09:22:04,496 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:22:04,497 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:22:04,498 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:22:04,498 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = 2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 1 Supporting invariants [] [2018-12-08 09:22:04,526 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:22:04,531 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:22:04,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:04,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:04,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:04,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:04,574 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:04,599 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-12-08 09:22:04,601 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 09:22:04,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:04,613 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:04,618 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:04,618 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:34, output treesize:30 [2018-12-08 09:22:04,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:04,646 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-12-08 09:22:04,647 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4 Second operand 4 states. [2018-12-08 09:22:04,713 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states and 15 transitions. cyclomatic complexity: 4. Second operand 4 states. Result 31 states and 40 transitions. Complement of second has 8 states. [2018-12-08 09:22:04,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 09:22:04,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 09:22:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2018-12-08 09:22:04,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-08 09:22:04,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:04,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-08 09:22:04,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:04,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-08 09:22:04,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:04,717 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2018-12-08 09:22:04,718 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2018-12-08 09:22:04,718 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 30 states and 39 transitions. [2018-12-08 09:22:04,719 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-08 09:22:04,719 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-12-08 09:22:04,719 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 39 transitions. [2018-12-08 09:22:04,719 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:22:04,719 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2018-12-08 09:22:04,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 39 transitions. [2018-12-08 09:22:04,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2018-12-08 09:22:04,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-08 09:22:04,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2018-12-08 09:22:04,721 INFO L728 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-08 09:22:04,721 INFO L608 BuchiCegarLoop]: Abstraction has 26 states and 35 transitions. [2018-12-08 09:22:04,721 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 09:22:04,721 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 35 transitions. [2018-12-08 09:22:04,722 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2018-12-08 09:22:04,722 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:04,722 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:04,722 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 09:22:04,722 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 09:22:04,722 INFO L794 eck$LassoCheckResult]: Stem: 217#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 215#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 216#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2018-12-08 09:22:04,723 INFO L796 eck$LassoCheckResult]: Loop: 222#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 223#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 228#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 218#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 219#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 226#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 237#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 236#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 232#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 230#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 222#L553-1 [2018-12-08 09:22:04,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:04,723 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-08 09:22:04,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:04,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:04,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:04,724 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:04,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:04,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:04,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:04,736 INFO L82 PathProgramCache]: Analyzing trace with hash 15750502, now seen corresponding path program 1 times [2018-12-08 09:22:04,736 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:04,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:04,737 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:04,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:04,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:04,786 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:04,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:22:04,786 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:22:04,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:04,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:04,803 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:04,809 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 09:22:04,810 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 09:22:04,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:04,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:04,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:04,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-08 09:22:04,815 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:04,816 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 09:22:04,818 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:04,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:22:04,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:04,821 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:04,822 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:04,822 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-08 09:22:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:04,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:22:04,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2018-12-08 09:22:04,854 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 09:22:04,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-08 09:22:04,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-12-08 09:22:04,854 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. cyclomatic complexity: 11 Second operand 7 states. [2018-12-08 09:22:04,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:22:04,912 INFO L93 Difference]: Finished difference Result 47 states and 60 transitions. [2018-12-08 09:22:04,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-08 09:22:04,912 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 47 states and 60 transitions. [2018-12-08 09:22:04,913 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 20 [2018-12-08 09:22:04,914 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 47 states to 47 states and 60 transitions. [2018-12-08 09:22:04,914 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-12-08 09:22:04,914 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 24 [2018-12-08 09:22:04,914 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 60 transitions. [2018-12-08 09:22:04,914 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:22:04,915 INFO L705 BuchiCegarLoop]: Abstraction has 47 states and 60 transitions. [2018-12-08 09:22:04,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states and 60 transitions. [2018-12-08 09:22:04,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 34. [2018-12-08 09:22:04,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-08 09:22:04,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 45 transitions. [2018-12-08 09:22:04,916 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2018-12-08 09:22:04,916 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 45 transitions. [2018-12-08 09:22:04,916 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 09:22:04,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 45 transitions. [2018-12-08 09:22:04,917 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2018-12-08 09:22:04,917 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:04,917 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:04,917 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 09:22:04,917 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:22:04,917 INFO L794 eck$LassoCheckResult]: Stem: 331#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 329#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 330#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2018-12-08 09:22:04,917 INFO L796 eck$LassoCheckResult]: Loop: 332#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 333#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 344#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 336#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 337#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 340#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 353#L555-1 assume !test_fun_#t~short8; 350#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 346#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 342#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 332#L553-1 [2018-12-08 09:22:04,917 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:04,917 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 2 times [2018-12-08 09:22:04,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:04,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:04,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:04,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:04,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:04,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:04,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:04,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:04,928 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 1 times [2018-12-08 09:22:04,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:04,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:04,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:04,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:04,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:04,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:04,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:04,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 1 times [2018-12-08 09:22:04,943 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:04,943 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:04,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:04,944 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:04,944 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:04,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:04,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:05,082 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-12-08 09:22:05,209 WARN L180 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2018-12-08 09:22:05,257 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:22:05,258 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:22:05,258 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:22:05,258 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:22:05,258 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:22:05,258 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:22:05,258 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:22:05,258 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:22:05,258 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration5_Lasso [2018-12-08 09:22:05,258 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:22:05,258 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:22:05,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,262 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,271 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,272 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,421 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:05,615 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:22:05,615 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:22:05,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:05,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,616 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,616 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:05,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:05,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:05,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,618 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,618 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:05,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:05,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,618 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,618 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,619 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,619 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:05,619 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:05,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:05,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,621 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,621 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:05,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:05,621 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,621 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,622 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:05,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,622 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,622 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:05,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:05,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:05,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,623 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,623 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:05,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:05,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,624 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:05,624 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:05,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,626 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,626 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:05,627 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:05,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,630 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:05,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,630 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,630 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:05,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:05,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:05,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,632 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,632 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:05,632 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:05,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:05,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,634 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:05,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:05,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,635 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,635 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,635 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:05,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:05,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:05,647 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:05,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,651 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,652 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:05,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:05,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:05,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:05,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,663 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:22:05,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,663 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,664 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:22:05,664 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:05,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:05,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:05,668 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:05,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:05,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:05,668 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:05,669 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:05,669 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:05,676 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:22:05,681 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 09:22:05,681 INFO L444 ModelExtractionUtils]: 16 out of 19 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 09:22:05,682 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:22:05,682 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:22:05,682 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:22:05,682 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_2 Supporting invariants [] [2018-12-08 09:22:05,704 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:22:05,704 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:22:05,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:05,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:05,719 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:05,729 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:05,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 19 treesize of output 31 [2018-12-08 09:22:05,744 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2018-12-08 09:22:05,744 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:05,766 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2018-12-08 09:22:05,766 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-08 09:22:05,775 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:22:05,783 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:22:05,783 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:19, output treesize:30 [2018-12-08 09:22:05,854 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:05,863 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 64 [2018-12-08 09:22:05,868 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:05,869 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 26 [2018-12-08 09:22:05,869 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:05,891 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:05,892 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:05,893 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:05,894 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 37 [2018-12-08 09:22:05,894 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:05,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:22:05,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:22:05,918 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:52, output treesize:56 [2018-12-08 09:22:06,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:06,051 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 53 [2018-12-08 09:22:06,054 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:06,055 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-12-08 09:22:06,056 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,062 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,081 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:06,081 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 49 [2018-12-08 09:22:06,083 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 09:22:06,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:06,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 37 [2018-12-08 09:22:06,085 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,090 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,110 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2018-12-08 09:22:06,110 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 5 variables, input treesize:109, output treesize:60 [2018-12-08 09:22:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:06,136 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 9 loop predicates [2018-12-08 09:22:06,136 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13 Second operand 10 states. [2018-12-08 09:22:06,429 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 34 states and 45 transitions. cyclomatic complexity: 13. Second operand 10 states. Result 118 states and 150 transitions. Complement of second has 19 states. [2018-12-08 09:22:06,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 10 states 1 stem states 8 non-accepting loop states 1 accepting loop states [2018-12-08 09:22:06,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-12-08 09:22:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 29 transitions. [2018-12-08 09:22:06,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 10 letters. [2018-12-08 09:22:06,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:06,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 13 letters. Loop has 10 letters. [2018-12-08 09:22:06,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:06,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 10 states and 29 transitions. Stem has 3 letters. Loop has 20 letters. [2018-12-08 09:22:06,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:06,431 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 150 transitions. [2018-12-08 09:22:06,432 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2018-12-08 09:22:06,432 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 113 states and 145 transitions. [2018-12-08 09:22:06,432 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-12-08 09:22:06,432 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-08 09:22:06,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 113 states and 145 transitions. [2018-12-08 09:22:06,433 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:22:06,433 INFO L705 BuchiCegarLoop]: Abstraction has 113 states and 145 transitions. [2018-12-08 09:22:06,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states and 145 transitions. [2018-12-08 09:22:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2018-12-08 09:22:06,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-12-08 09:22:06,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 131 transitions. [2018-12-08 09:22:06,436 INFO L728 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2018-12-08 09:22:06,436 INFO L608 BuchiCegarLoop]: Abstraction has 99 states and 131 transitions. [2018-12-08 09:22:06,436 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 09:22:06,436 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 99 states and 131 transitions. [2018-12-08 09:22:06,437 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 28 [2018-12-08 09:22:06,437 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:06,437 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:06,437 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 09:22:06,437 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 1, 1, 1, 1] [2018-12-08 09:22:06,437 INFO L794 eck$LassoCheckResult]: Stem: 617#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 615#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 616#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 679#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2018-12-08 09:22:06,437 INFO L796 eck$LassoCheckResult]: Loop: 619#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 637#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 622#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 623#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 626#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 629#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 662#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 659#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 658#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 642#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 643#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 634#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 631#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 618#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 619#L555-5 [2018-12-08 09:22:06,438 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:06,438 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 1 times [2018-12-08 09:22:06,438 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:06,438 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:06,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:06,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:06,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:06,445 INFO L82 PathProgramCache]: Analyzing trace with hash 527155748, now seen corresponding path program 2 times [2018-12-08 09:22:06,445 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:06,446 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:06,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:06,446 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:06,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:06,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:06,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1781235253, now seen corresponding path program 1 times [2018-12-08 09:22:06,473 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:06,473 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,474 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:06,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:06,530 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:06,530 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:22:06,530 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:22:06,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:06,554 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:06,561 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 09:22:06,562 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 09:22:06,563 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,565 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,565 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-08 09:22:06,568 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:06,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 09:22:06,573 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:06,573 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:22:06,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,575 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-08 09:22:06,582 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:06,583 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-12-08 09:22:06,585 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:06,586 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 7 [2018-12-08 09:22:06,586 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,587 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,588 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:06,588 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:7 [2018-12-08 09:22:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:06,608 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:22:06,608 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2018-12-08 09:22:06,835 WARN L180 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 95 [2018-12-08 09:22:06,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-08 09:22:06,867 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-12-08 09:22:06,867 INFO L87 Difference]: Start difference. First operand 99 states and 131 transitions. cyclomatic complexity: 38 Second operand 9 states. [2018-12-08 09:22:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:22:06,938 INFO L93 Difference]: Finished difference Result 141 states and 177 transitions. [2018-12-08 09:22:06,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-08 09:22:06,938 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 177 transitions. [2018-12-08 09:22:06,940 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 44 [2018-12-08 09:22:06,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 139 states and 175 transitions. [2018-12-08 09:22:06,942 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 51 [2018-12-08 09:22:06,942 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-12-08 09:22:06,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 175 transitions. [2018-12-08 09:22:06,943 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:22:06,943 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 175 transitions. [2018-12-08 09:22:06,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 175 transitions. [2018-12-08 09:22:06,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 109. [2018-12-08 09:22:06,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-12-08 09:22:06,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 143 transitions. [2018-12-08 09:22:06,947 INFO L728 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-12-08 09:22:06,947 INFO L608 BuchiCegarLoop]: Abstraction has 109 states and 143 transitions. [2018-12-08 09:22:06,947 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 09:22:06,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 143 transitions. [2018-12-08 09:22:06,948 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 33 [2018-12-08 09:22:06,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:06,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:06,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2018-12-08 09:22:06,949 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 09:22:06,949 INFO L794 eck$LassoCheckResult]: Stem: 928#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 926#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 927#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 985#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2018-12-08 09:22:06,949 INFO L796 eck$LassoCheckResult]: Loop: 930#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 943#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 968#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 966#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 967#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 947#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 933#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 934#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 937#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 965#L555-1 assume !test_fun_#t~short8; 981#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 980#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 969#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 929#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 930#L555-5 [2018-12-08 09:22:06,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:06,949 INFO L82 PathProgramCache]: Analyzing trace with hash 925672, now seen corresponding path program 2 times [2018-12-08 09:22:06,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:06,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:06,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:06,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:06,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:06,958 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:06,959 INFO L82 PathProgramCache]: Analyzing trace with hash 529002790, now seen corresponding path program 2 times [2018-12-08 09:22:06,959 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:06,959 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:06,959 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,960 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:06,960 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:06,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:06,982 INFO L82 PathProgramCache]: Analyzing trace with hash -1779388211, now seen corresponding path program 2 times [2018-12-08 09:22:06,982 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:06,982 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:06,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,983 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:06,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:07,274 WARN L180 SmtUtils]: Spent 276.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 92 [2018-12-08 09:22:07,454 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2018-12-08 09:22:07,497 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:22:07,497 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:22:07,497 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:22:07,497 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:22:07,497 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:22:07,497 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:22:07,497 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:22:07,497 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:22:07,497 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration7_Lasso [2018-12-08 09:22:07,497 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:22:07,497 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:22:07,499 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,500 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,501 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,503 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,504 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:07,816 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:22:07,816 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:22:07,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:07,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:07,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:07,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:07,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:07,817 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:07,817 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:07,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:07,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:07,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:07,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:07,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:07,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:07,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:07,819 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:07,819 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:07,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:07,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:07,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:07,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:07,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:07,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:07,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:07,820 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:07,820 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:07,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:07,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:07,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:07,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:07,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:07,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:07,821 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:07,822 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:07,822 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:07,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:07,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:07,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:07,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:07,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:07,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:07,823 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:07,823 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:07,823 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:07,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:07,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:07,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:07,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:07,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:07,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:07,824 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:07,825 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:07,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:07,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:07,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:07,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:07,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:07,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:07,826 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:07,826 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:07,826 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:07,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:07,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:07,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:07,829 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:22:07,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:07,829 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:07,830 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:22:07,830 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:07,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:07,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:07,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:07,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:07,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:07,832 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:07,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:07,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:07,842 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:22:07,855 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-12-08 09:22:07,855 INFO L444 ModelExtractionUtils]: 15 out of 19 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 09:22:07,855 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:22:07,856 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 09:22:07,856 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:22:07,856 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2018-12-08 09:22:07,878 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:22:07,879 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:22:07,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:07,893 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:07,902 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:07,939 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:07,949 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2018-12-08 09:22:07,952 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:07,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:07,953 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:07,954 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 50 [2018-12-08 09:22:07,955 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:07,981 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:07,982 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 39 [2018-12-08 09:22:07,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:08,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 09:22:08,025 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 09:22:08,025 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2018-12-08 09:22:08,084 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:08,084 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-12-08 09:22:08,088 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:08,090 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-12-08 09:22:08,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:08,099 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:08,130 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:08,130 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-08 09:22:08,133 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:08,133 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-12-08 09:22:08,134 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:08,140 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:08,153 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 09:22:08,154 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-12-08 09:22:08,185 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:08,185 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-12-08 09:22:08,189 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:08,190 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-12-08 09:22:08,190 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:08,199 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:08,225 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:08,227 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-12-08 09:22:08,229 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:08,229 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-08 09:22:08,230 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:08,235 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:08,257 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 09:22:08,257 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-12-08 09:22:08,284 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:08,284 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-08 09:22:08,284 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2018-12-08 09:22:09,496 WARN L180 SmtUtils]: Spent 922.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 43 [2018-12-08 09:22:10,625 WARN L180 SmtUtils]: Spent 977.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 25 [2018-12-08 09:22:11,639 WARN L180 SmtUtils]: Spent 967.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 27 [2018-12-08 09:22:11,650 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 281 states and 357 transitions. Complement of second has 27 states. [2018-12-08 09:22:11,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-12-08 09:22:11,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 09:22:11,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 32 transitions. [2018-12-08 09:22:11,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 32 transitions. Stem has 4 letters. Loop has 14 letters. [2018-12-08 09:22:11,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:11,651 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:22:11,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:11,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:11,663 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:11,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:11,672 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:11,703 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,710 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 45 treesize of output 59 [2018-12-08 09:22:11,713 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,713 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2018-12-08 09:22:11,714 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:11,739 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,742 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 50 [2018-12-08 09:22:11,742 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:11,765 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 09:22:11,789 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 3 xjuncts. [2018-12-08 09:22:11,789 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:45, output treesize:114 [2018-12-08 09:22:11,836 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,836 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-12-08 09:22:11,843 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,845 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2018-12-08 09:22:11,845 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,853 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,873 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,874 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 53 [2018-12-08 09:22:11,877 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,877 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2018-12-08 09:22:11,877 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,883 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,898 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 09:22:11,898 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-12-08 09:22:11,929 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,930 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 52 [2018-12-08 09:22:11,937 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,937 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 37 [2018-12-08 09:22:11,938 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,948 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,972 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,974 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 51 [2018-12-08 09:22:11,977 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:11,977 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 24 [2018-12-08 09:22:11,977 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:11,984 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:12,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-12-08 09:22:12,000 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:104, output treesize:70 [2018-12-08 09:22:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:12,027 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 7 loop predicates [2018-12-08 09:22:12,027 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40 Second operand 8 states. [2018-12-08 09:22:12,930 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 109 states and 143 transitions. cyclomatic complexity: 40. Second operand 8 states. Result 353 states and 447 transitions. Complement of second has 29 states. [2018-12-08 09:22:12,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 15 states 1 stem states 13 non-accepting loop states 1 accepting loop states [2018-12-08 09:22:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 09:22:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 33 transitions. [2018-12-08 09:22:12,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 14 letters. [2018-12-08 09:22:12,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:12,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 18 letters. Loop has 14 letters. [2018-12-08 09:22:12,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:12,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 15 states and 33 transitions. Stem has 4 letters. Loop has 28 letters. [2018-12-08 09:22:12,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:12,932 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 447 transitions. [2018-12-08 09:22:12,933 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2018-12-08 09:22:12,935 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 286 states and 366 transitions. [2018-12-08 09:22:12,935 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2018-12-08 09:22:12,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2018-12-08 09:22:12,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 286 states and 366 transitions. [2018-12-08 09:22:12,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:22:12,935 INFO L705 BuchiCegarLoop]: Abstraction has 286 states and 366 transitions. [2018-12-08 09:22:12,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states and 366 transitions. [2018-12-08 09:22:12,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 233. [2018-12-08 09:22:12,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-12-08 09:22:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 304 transitions. [2018-12-08 09:22:12,947 INFO L728 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2018-12-08 09:22:12,947 INFO L608 BuchiCegarLoop]: Abstraction has 233 states and 304 transitions. [2018-12-08 09:22:12,947 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 09:22:12,947 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 233 states and 304 transitions. [2018-12-08 09:22:12,948 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-12-08 09:22:12,948 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:12,948 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:12,948 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-12-08 09:22:12,948 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:22:12,948 INFO L794 eck$LassoCheckResult]: Stem: 1944#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1942#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 1943#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 1945#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1946#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2018-12-08 09:22:12,948 INFO L796 eck$LassoCheckResult]: Loop: 1959#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 1950#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1951#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 1954#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 1959#L555-1 [2018-12-08 09:22:12,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:12,948 INFO L82 PathProgramCache]: Analyzing trace with hash 28695849, now seen corresponding path program 1 times [2018-12-08 09:22:12,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:12,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:12,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:12,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:12,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:12,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:12,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:12,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 1 times [2018-12-08 09:22:12,955 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:12,955 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:12,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:12,956 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:12,956 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:12,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:12,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:12,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:12,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1271571777, now seen corresponding path program 1 times [2018-12-08 09:22:12,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:12,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:12,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:12,961 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:12,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:12,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:12,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:13,238 WARN L180 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 93 [2018-12-08 09:22:13,534 WARN L180 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 85 [2018-12-08 09:22:13,536 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:22:13,536 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:22:13,536 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:22:13,536 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:22:13,536 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:22:13,536 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:22:13,536 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:22:13,536 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:22:13,536 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration8_Lasso [2018-12-08 09:22:13,536 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:22:13,536 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:22:13,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,798 WARN L180 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 69 [2018-12-08 09:22:13,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:13,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:14,237 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:22:14,238 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:22:14,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:14,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,238 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,239 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:14,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:14,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:14,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:14,240 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:14,241 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,241 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,241 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,241 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:14,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:14,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:14,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:14,242 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:14,242 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,243 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:14,243 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:14,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:14,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,244 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:14,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:14,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:14,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:14,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:14,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,247 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:14,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:14,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,248 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:22:14,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,249 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:22:14,249 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:14,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:14,253 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:14,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,260 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:14,260 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:14,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:14,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:14,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:14,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:14,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:14,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:14,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:14,265 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:22:14,265 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 09:22:14,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:14,273 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 09:22:14,273 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 09:22:14,385 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:22:14,465 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-08 09:22:14,465 INFO L444 ModelExtractionUtils]: 35 out of 46 variables were initially zero. Simplification set additionally 8 variables to zero. [2018-12-08 09:22:14,465 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:22:14,466 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-08 09:22:14,467 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:22:14,467 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 + 2147483647 Supporting invariants [] [2018-12-08 09:22:14,494 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:22:14,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:22:14,503 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:14,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:14,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:14,516 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:14,542 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:14,543 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-12-08 09:22:14,545 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:14,545 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-12-08 09:22:14,546 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,553 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,558 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:14,558 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-12-08 09:22:14,567 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:14,568 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-08 09:22:14,568 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84 Second operand 5 states. [2018-12-08 09:22:14,604 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 233 states and 304 transitions. cyclomatic complexity: 84. Second operand 5 states. Result 372 states and 485 transitions. Complement of second has 9 states. [2018-12-08 09:22:14,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 09:22:14,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:22:14,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 13 transitions. [2018-12-08 09:22:14,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 4 letters. [2018-12-08 09:22:14,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:14,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 9 letters. Loop has 4 letters. [2018-12-08 09:22:14,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:14,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 13 transitions. Stem has 5 letters. Loop has 8 letters. [2018-12-08 09:22:14,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:14,605 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 372 states and 485 transitions. [2018-12-08 09:22:14,609 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-12-08 09:22:14,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 372 states to 317 states and 410 transitions. [2018-12-08 09:22:14,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 48 [2018-12-08 09:22:14,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-12-08 09:22:14,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 317 states and 410 transitions. [2018-12-08 09:22:14,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:22:14,611 INFO L705 BuchiCegarLoop]: Abstraction has 317 states and 410 transitions. [2018-12-08 09:22:14,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states and 410 transitions. [2018-12-08 09:22:14,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 266. [2018-12-08 09:22:14,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 09:22:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 349 transitions. [2018-12-08 09:22:14,617 INFO L728 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2018-12-08 09:22:14,617 INFO L608 BuchiCegarLoop]: Abstraction has 266 states and 349 transitions. [2018-12-08 09:22:14,617 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 09:22:14,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 349 transitions. [2018-12-08 09:22:14,618 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-12-08 09:22:14,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:14,619 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:14,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:22:14,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:22:14,619 INFO L794 eck$LassoCheckResult]: Stem: 2649#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2647#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 2648#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2664#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2835#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2796#L555-1 assume !test_fun_#t~short8; 2725#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 2678#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2675#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2018-12-08 09:22:14,619 INFO L796 eck$LassoCheckResult]: Loop: 2676#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2724#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2714#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 2650#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 2651#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 2696#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 2681#L555-1 assume !test_fun_#t~short8; 2683#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 2667#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 2668#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 2676#L553-1 [2018-12-08 09:22:14,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1271629551, now seen corresponding path program 2 times [2018-12-08 09:22:14,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:14,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:14,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 09:22:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:14,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:14,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:14,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:14,629 INFO L82 PathProgramCache]: Analyzing trace with hash 15810084, now seen corresponding path program 3 times [2018-12-08 09:22:14,629 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:14,629 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:14,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:14,630 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:14,630 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:14,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:14,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:14,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:14,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1831564178, now seen corresponding path program 3 times [2018-12-08 09:22:14,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:14,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:14,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:14,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:14,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:14,706 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 09:22:14,706 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:22:14,706 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:22:14,715 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-08 09:22:14,732 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-08 09:22:14,732 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 09:22:14,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:14,740 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-12-08 09:22:14,741 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,744 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,744 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:8, output treesize:4 [2018-12-08 09:22:14,747 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 09:22:14,749 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 09:22:14,749 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,750 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,757 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,757 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:16, output treesize:12 [2018-12-08 09:22:14,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:14,791 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 43 [2018-12-08 09:22:14,793 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:14,794 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 23 [2018-12-08 09:22:14,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,797 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,800 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,801 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:40, output treesize:25 [2018-12-08 09:22:14,817 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 09:22:14,818 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 29 [2018-12-08 09:22:14,819 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2018-12-08 09:22:14,819 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,823 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,826 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:14,827 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-12-08 09:22:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 09:22:14,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:22:14,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 13 [2018-12-08 09:22:14,988 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 73 [2018-12-08 09:22:15,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-08 09:22:15,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2018-12-08 09:22:15,010 INFO L87 Difference]: Start difference. First operand 266 states and 349 transitions. cyclomatic complexity: 98 Second operand 13 states. [2018-12-08 09:22:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:22:15,083 INFO L93 Difference]: Finished difference Result 313 states and 355 transitions. [2018-12-08 09:22:15,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-08 09:22:15,083 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 355 transitions. [2018-12-08 09:22:15,085 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 38 [2018-12-08 09:22:15,085 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 139 states and 158 transitions. [2018-12-08 09:22:15,085 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 52 [2018-12-08 09:22:15,086 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 52 [2018-12-08 09:22:15,086 INFO L73 IsDeterministic]: Start isDeterministic. Operand 139 states and 158 transitions. [2018-12-08 09:22:15,086 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:22:15,086 INFO L705 BuchiCegarLoop]: Abstraction has 139 states and 158 transitions. [2018-12-08 09:22:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states and 158 transitions. [2018-12-08 09:22:15,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 130. [2018-12-08 09:22:15,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-12-08 09:22:15,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 149 transitions. [2018-12-08 09:22:15,089 INFO L728 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-12-08 09:22:15,089 INFO L608 BuchiCegarLoop]: Abstraction has 130 states and 149 transitions. [2018-12-08 09:22:15,089 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 09:22:15,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 130 states and 149 transitions. [2018-12-08 09:22:15,090 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 37 [2018-12-08 09:22:15,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:15,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:15,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 09:22:15,090 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 09:22:15,091 INFO L794 eck$LassoCheckResult]: Stem: 3306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3304#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 3305#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3351#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3350#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3345#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3346#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3341#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3342#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3338#L555-1 assume !test_fun_#t~short8; 3337#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 3336#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3334#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3322#L553-1 [2018-12-08 09:22:15,091 INFO L796 eck$LassoCheckResult]: Loop: 3322#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3401#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3398#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3396#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3394#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3391#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3389#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3386#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3387#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3380#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3381#L555-1 assume !test_fun_#t~short8; 3332#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 3333#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3321#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3322#L553-1 [2018-12-08 09:22:15,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:15,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1871610631, now seen corresponding path program 4 times [2018-12-08 09:22:15,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:15,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:15,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:15,092 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:15,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:15,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:15,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:15,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:15,104 INFO L82 PathProgramCache]: Analyzing trace with hash 535533500, now seen corresponding path program 4 times [2018-12-08 09:22:15,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:15,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:15,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:15,105 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:15,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:15,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:15,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:15,117 INFO L82 PathProgramCache]: Analyzing trace with hash -1585620926, now seen corresponding path program 5 times [2018-12-08 09:22:15,117 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:15,117 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:15,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:15,117 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:15,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 09:22:15,259 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 09:22:15,259 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b90ae53-fca2-4746-9355-d36b79c7b188/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-08 09:22:15,266 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-12-08 09:22:15,285 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2018-12-08 09:22:15,285 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-08 09:22:15,287 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:15,291 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-12-08 09:22:15,292 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-12-08 09:22:15,292 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,295 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,295 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:11, output treesize:7 [2018-12-08 09:22:15,334 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,342 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 54 [2018-12-08 09:22:15,346 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,347 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 19 [2018-12-08 09:22:15,347 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,360 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,361 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 30 [2018-12-08 09:22:15,363 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,373 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:22:15,382 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:22:15,382 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:38, output treesize:42 [2018-12-08 09:22:15,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,481 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2018-12-08 09:22:15,483 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 09:22:15,484 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,484 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2018-12-08 09:22:15,485 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,491 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,507 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,509 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 48 [2018-12-08 09:22:15,511 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,512 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-12-08 09:22:15,512 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,518 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,529 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:22:15,529 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:98, output treesize:47 [2018-12-08 09:22:15,556 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,565 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 51 [2018-12-08 09:22:15,568 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 26 [2018-12-08 09:22:15,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,590 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,591 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:15,592 INFO L683 Elim1Store]: detected equality via solver [2018-12-08 09:22:15,592 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2018-12-08 09:22:15,592 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 09:22:15,606 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:22:15,620 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 09:22:15,621 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 1 variables, input treesize:39, output treesize:49 [2018-12-08 09:22:15,677 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 27 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-08 09:22:15,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-12-08 09:22:15,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2018-12-08 09:22:15,884 WARN L180 SmtUtils]: Spent 191.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2018-12-08 09:22:15,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-12-08 09:22:15,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2018-12-08 09:22:15,905 INFO L87 Difference]: Start difference. First operand 130 states and 149 transitions. cyclomatic complexity: 27 Second operand 21 states. [2018-12-08 09:22:16,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 09:22:16,133 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2018-12-08 09:22:16,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-12-08 09:22:16,133 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 103 states and 113 transitions. [2018-12-08 09:22:16,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 09:22:16,134 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 103 states to 69 states and 78 transitions. [2018-12-08 09:22:16,134 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-12-08 09:22:16,134 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-12-08 09:22:16,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 78 transitions. [2018-12-08 09:22:16,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 09:22:16,134 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 78 transitions. [2018-12-08 09:22:16,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 78 transitions. [2018-12-08 09:22:16,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 42. [2018-12-08 09:22:16,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-12-08 09:22:16,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 49 transitions. [2018-12-08 09:22:16,135 INFO L728 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-12-08 09:22:16,135 INFO L608 BuchiCegarLoop]: Abstraction has 42 states and 49 transitions. [2018-12-08 09:22:16,135 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 09:22:16,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 42 states and 49 transitions. [2018-12-08 09:22:16,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 4 [2018-12-08 09:22:16,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 09:22:16,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 09:22:16,136 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 09:22:16,136 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 09:22:16,136 INFO L794 eck$LassoCheckResult]: Stem: 3664#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3662#L-1 havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~ret16;test_fun_#in~x, test_fun_#in~y := main_#t~nondet14, main_#t~nondet15;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~mem9, test_fun_#t~mem10, test_fun_#t~mem11, test_fun_#t~mem5, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~short8, test_fun_#t~mem12, test_fun_#t~mem4, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call 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); 3663#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3669#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3670#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3700#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3699#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3698#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3697#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3696#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3695#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3694#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3693#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3682#L555-1 assume !test_fun_#t~short8; 3680#L555-3 assume !test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8; 3679#L555-6 call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 3678#L553-3 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 3671#L553-1 assume !!(test_fun_#t~mem4 >= 0);havoc test_fun_#t~mem4;call write~int(1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3672#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3676#L555-1 [2018-12-08 09:22:16,136 INFO L796 eck$LassoCheckResult]: Loop: 3676#L555-1 assume test_fun_#t~short8;call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem7 < 1073741824; 3665#L555-3 assume !!test_fun_#t~short8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem5;havoc test_fun_#t~mem7;havoc test_fun_#t~short8;call test_fun_#t~mem9 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 3666#L556 assume !(test_fun_#t~mem9 <= 0);havoc test_fun_#t~mem9;call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(2 * test_fun_#t~mem11, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem11; 3673#L555-5 call test_fun_#t~mem5 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem6 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short8 := test_fun_#t~mem5 > test_fun_#t~mem6; 3676#L555-1 [2018-12-08 09:22:16,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:16,136 INFO L82 PathProgramCache]: Analyzing trace with hash 673540324, now seen corresponding path program 6 times [2018-12-08 09:22:16,136 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:16,136 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:16,137 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:16,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:16,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:16,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:16,148 INFO L82 PathProgramCache]: Analyzing trace with hash 1547289, now seen corresponding path program 2 times [2018-12-08 09:22:16,148 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:16,148 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:16,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:16,149 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:16,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:16,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:16,152 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:16,152 INFO L82 PathProgramCache]: Analyzing trace with hash 1405606780, now seen corresponding path program 7 times [2018-12-08 09:22:16,152 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 09:22:16,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 09:22:16,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:16,153 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 09:22:16,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 09:22:16,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:16,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 09:22:17,573 WARN L180 SmtUtils]: Spent 1.30 s on a formula simplification. DAG size of input: 198 DAG size of output: 150 [2018-12-08 09:22:17,654 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 09:22:17,654 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 09:22:17,654 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 09:22:17,654 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 09:22:17,655 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 09:22:17,655 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 09:22:17,655 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 09:22:17,655 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 09:22:17,655 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.01_assume-alloca_true-termination_true-no-overflow.c.i_Iteration11_Lasso [2018-12-08 09:22:17,655 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 09:22:17,655 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 09:22:17,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,662 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,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-12-08 09:22:17,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,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-12-08 09:22:17,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-12-08 09:22:17,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 09:22:17,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-12-08 09:22:18,087 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 09:22:18,087 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 09:22:18,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,088 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:18,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:18,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:18,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,089 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:18,090 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:18,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,090 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,091 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:18,091 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:18,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:18,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,093 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:18,093 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:18,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:18,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,094 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:18,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:18,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:18,096 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:18,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:18,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,098 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,098 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:18,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:18,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:18,099 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,099 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,100 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,100 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:18,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:18,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:18,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,101 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:18,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:18,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:18,102 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,102 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,102 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,103 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:18,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:18,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:18,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:18,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:18,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,106 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:18,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:18,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,106 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:18,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,107 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,107 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:18,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:18,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,108 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:18,108 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:18,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 09:22:18,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 09:22:18,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 09:22:18,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,110 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,110 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:18,110 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:18,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 09:22:18,112 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:18,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,114 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:22:18,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,114 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,115 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:22:18,115 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:18,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,118 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 09:22:18,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 09:22:18,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,118 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 09:22:18,118 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 09:22:18,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 09:22:18,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 09:22:18,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 09:22:18,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 09:22:18,121 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 09:22:18,122 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 09:22:18,128 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-08 09:22:18,128 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 09:22:18,202 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 09:22:18,252 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-12-08 09:22:18,253 INFO L444 ModelExtractionUtils]: 37 out of 46 variables were initially zero. Simplification set additionally 6 variables to zero. [2018-12-08 09:22:18,253 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 09:22:18,254 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-12-08 09:22:18,254 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 09:22:18,254 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_5 + 2147483647 Supporting invariants [] [2018-12-08 09:22:18,280 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2018-12-08 09:22:18,281 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 09:22:18,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:18,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:18,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:18,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:18,312 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:18,333 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:18,334 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-12-08 09:22:18,336 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:18,336 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-12-08 09:22:18,337 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:18,342 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:18,350 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:18,350 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-12-08 09:22:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:18,358 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-08 09:22:18,358 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-08 09:22:18,379 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 56 states and 66 transitions. Complement of second has 9 states. [2018-12-08 09:22:18,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 09:22:18,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:22:18,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-12-08 09:22:18,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-08 09:22:18,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:18,380 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:22:18,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:18,398 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:18,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:18,403 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:18,424 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:18,424 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-12-08 09:22:18,426 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:18,427 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-12-08 09:22:18,427 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:18,432 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:18,437 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:18,437 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-12-08 09:22:18,445 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:18,445 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-08 09:22:18,445 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-08 09:22:18,472 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 55 states and 64 transitions. Complement of second has 11 states. [2018-12-08 09:22:18,472 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-12-08 09:22:18,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:22:18,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2018-12-08 09:22:18,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-08 09:22:18,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:18,473 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 09:22:18,479 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 09:22:18,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:18,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:18,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 09:22:18,497 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 09:22:18,517 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:18,517 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2018-12-08 09:22:18,519 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 09:22:18,519 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 29 [2018-12-08 09:22:18,520 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:18,524 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:18,528 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-08 09:22:18,528 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:43, output treesize:23 [2018-12-08 09:22:18,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 09:22:18,536 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-12-08 09:22:18,536 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10 Second operand 5 states. [2018-12-08 09:22:18,556 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 42 states and 49 transitions. cyclomatic complexity: 10. Second operand 5 states. Result 69 states and 84 transitions. Complement of second has 10 states. [2018-12-08 09:22:18,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-12-08 09:22:18,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 09:22:18,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-12-08 09:22:18,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2018-12-08 09:22:18,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:18,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 23 letters. Loop has 4 letters. [2018-12-08 09:22:18,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:18,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 19 letters. Loop has 8 letters. [2018-12-08 09:22:18,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 09:22:18,557 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 69 states and 84 transitions. [2018-12-08 09:22:18,558 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:22:18,558 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 69 states to 0 states and 0 transitions. [2018-12-08 09:22:18,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 09:22:18,558 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 09:22:18,558 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 09:22:18,558 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 09:22:18,558 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:22:18,558 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:22:18,559 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 09:22:18,559 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-08 09:22:18,559 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 09:22:18,559 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 09:22:18,559 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 09:22:18,563 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 09:22:18 BoogieIcfgContainer [2018-12-08 09:22:18,563 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 09:22:18,564 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 09:22:18,564 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 09:22:18,564 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 09:22:18,564 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 09:22:03" (3/4) ... [2018-12-08 09:22:18,566 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 09:22:18,567 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 09:22:18,567 INFO L168 Benchmark]: Toolchain (without parser) took 15659.86 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 282.1 MB). Free memory was 950.6 MB in the beginning and 1.0 GB in the end (delta: -68.2 MB). Peak memory consumption was 213.9 MB. Max. memory is 11.5 GB. [2018-12-08 09:22:18,568 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:22:18,568 INFO L168 Benchmark]: CACSL2BoogieTranslator took 249.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:22:18,568 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:22:18,569 INFO L168 Benchmark]: Boogie Preprocessor took 13.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:22:18,569 INFO L168 Benchmark]: RCFGBuilder took 154.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-12-08 09:22:18,569 INFO L168 Benchmark]: BuchiAutomizer took 15212.60 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 230.3 MB. Max. memory is 11.5 GB. [2018-12-08 09:22:18,569 INFO L168 Benchmark]: Witness Printer took 3.01 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 09:22:18,571 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 249.13 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 107.0 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -145.7 MB). Peak memory consumption was 24.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.59 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.71 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 154.25 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15212.60 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 175.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 55.2 MB). Peak memory consumption was 230.3 MB. Max. memory is 11.5 GB. * Witness Printer took 3.01 ms. Allocated memory is still 1.3 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 - 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 11 terminating modules (6 trivial, 4 deterministic, 1 nondeterministic). One deterministic module has affine ranking function 2 * unknown-#memory_int-unknown[x_ref][x_ref] + 1 and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 10 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 15 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. One nondeterministic module has affine ranking function -2 * unknown-#memory_int-unknown[y_ref][y_ref] + 2147483647 and consists of 5 locations. 6 modules have a trivial ranking function, the largest among these consists of 21 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.1s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 8.2s. Construction of modules took 0.8s. Büchi inclusion checks took 6.0s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 8. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 206 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 8. Nontrivial modules had stage [3, 1, 1, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 2/13 HoareTripleCheckerStatistics: 93 SDtfs, 186 SDslu, 83 SDs, 0 SdLazy, 774 SolverSat, 167 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 0.8s Time LassoAnalysisResults: nont0 unkn0 SFLI3 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso5 LassoPreprocessingBenchmarks: Lassos: inital364 mio100 ax105 hnf99 lsp82 ukn56 mio100 lsp35 div100 bol105 ite100 ukn100 eq168 hnf89 smp95 dnf172 smp82 tf100 neg100 sie103 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: sat Degree: 0 Time: 202ms VariablesStem: 8 VariablesLoop: 8 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...