./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/array-memsafety/array02-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/array-memsafety/array02-alloca-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/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 32bit --witnessprinter.graph.data.programhash 58d4e5463d025a43f4c9f80bcbe28ceb46ed79b1 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 22:08:40,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 22:08:40,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 22:08:40,618 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 22:08:40,618 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 22:08:40,619 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 22:08:40,621 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 22:08:40,623 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 22:08:40,625 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 22:08:40,626 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 22:08:40,627 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 22:08:40,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 22:08:40,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 22:08:40,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 22:08:40,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 22:08:40,632 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 22:08:40,633 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 22:08:40,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 22:08:40,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 22:08:40,639 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 22:08:40,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 22:08:40,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 22:08:40,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 22:08:40,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 22:08:40,647 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 22:08:40,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 22:08:40,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 22:08:40,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 22:08:40,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 22:08:40,651 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 22:08:40,651 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 22:08:40,652 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 22:08:40,653 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 22:08:40,654 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 22:08:40,655 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 22:08:40,655 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 22:08:40,656 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 22:08:40,656 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 22:08:40,657 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 22:08:40,658 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 22:08:40,658 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 22:08:40,659 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 22:08:40,677 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 22:08:40,678 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 22:08:40,679 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 22:08:40,679 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 22:08:40,680 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 22:08:40,680 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 22:08:40,680 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 22:08:40,681 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 22:08:40,681 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 22:08:40,681 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 22:08:40,681 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 22:08:40,682 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 22:08:40,682 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 22:08:40,682 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 22:08:40,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 22:08:40,683 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 22:08:40,683 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 22:08:40,683 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 22:08:40,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 22:08:40,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 22:08:40,684 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 22:08:40,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 22:08:40,685 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 22:08:40,685 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 22:08:40,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 22:08:40,686 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 22:08:40,686 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 22:08:40,686 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 22:08:40,687 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 22:08:40,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 22:08:40,687 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 22:08:40,688 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 22:08:40,688 INFO L138 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/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58d4e5463d025a43f4c9f80bcbe28ceb46ed79b1 [2019-11-15 22:08:40,717 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 22:08:40,729 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 22:08:40,733 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 22:08:40,734 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 22:08:40,735 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 22:08:40,736 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/../../sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2019-11-15 22:08:40,795 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/data/ff7824136/4e95461d9eb045b28ebe58bed1a83a9f/FLAGce50efc02 [2019-11-15 22:08:41,237 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 22:08:41,237 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/sv-benchmarks/c/array-memsafety/array02-alloca-2.i [2019-11-15 22:08:41,249 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/data/ff7824136/4e95461d9eb045b28ebe58bed1a83a9f/FLAGce50efc02 [2019-11-15 22:08:41,529 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/data/ff7824136/4e95461d9eb045b28ebe58bed1a83a9f [2019-11-15 22:08:41,532 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 22:08:41,533 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 22:08:41,534 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 22:08:41,534 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 22:08:41,538 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 22:08:41,539 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:08:41" (1/1) ... [2019-11-15 22:08:41,541 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@576556d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:41, skipping insertion in model container [2019-11-15 22:08:41,541 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 10:08:41" (1/1) ... [2019-11-15 22:08:41,548 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 22:08:41,580 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 22:08:41,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:08:41,943 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 22:08:41,984 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 22:08:42,028 INFO L192 MainTranslator]: Completed translation [2019-11-15 22:08:42,028 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42 WrapperNode [2019-11-15 22:08:42,029 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 22:08:42,029 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 22:08:42,030 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 22:08:42,030 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 22:08:42,037 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,050 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 22:08:42,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 22:08:42,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 22:08:42,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 22:08:42,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,082 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,082 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,093 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,094 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (1/1) ... [2019-11-15 22:08:42,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 22:08:42,097 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 22:08:42,097 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 22:08:42,097 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 22:08:42,098 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/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 [2019-11-15 22:08:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 22:08:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 22:08:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 22:08:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 22:08:42,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 22:08:42,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 22:08:42,448 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 22:08:42,449 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 22:08:42,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:08:42 BoogieIcfgContainer [2019-11-15 22:08:42,450 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 22:08:42,450 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 22:08:42,450 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 22:08:42,453 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 22:08:42,455 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:08:42,455 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 10:08:41" (1/3) ... [2019-11-15 22:08:42,456 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a789afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:08:42, skipping insertion in model container [2019-11-15 22:08:42,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:08:42,456 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 10:08:42" (2/3) ... [2019-11-15 22:08:42,456 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5a789afa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 10:08:42, skipping insertion in model container [2019-11-15 22:08:42,456 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 22:08:42,457 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:08:42" (3/3) ... [2019-11-15 22:08:42,461 INFO L371 chiAutomizerObserver]: Analyzing ICFG array02-alloca-2.i [2019-11-15 22:08:42,509 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 22:08:42,509 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 22:08:42,510 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 22:08:42,510 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 22:08:42,510 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 22:08:42,510 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 22:08:42,510 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 22:08:42,510 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 22:08:42,520 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 22:08:42,541 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 22:08:42,542 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:42,542 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:42,546 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:08:42,546 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:08:42,546 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 22:08:42,546 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-11-15 22:08:42,548 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 8 [2019-11-15 22:08:42,548 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:42,548 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:42,548 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2019-11-15 22:08:42,548 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:08:42,554 INFO L791 eck$LassoCheckResult]: Stem: 11#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 14#L530true assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 16#L530-2true call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 10#L535-3true [2019-11-15 22:08:42,554 INFO L793 eck$LassoCheckResult]: Loop: 10#L535-3true assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 7#L535-2true main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 10#L535-3true [2019-11-15 22:08:42,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:42,558 INFO L82 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2019-11-15 22:08:42,564 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:42,564 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529247715] [2019-11-15 22:08:42,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:42,564 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:42,565 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:42,668 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:42,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:42,669 INFO L82 PathProgramCache]: Analyzing trace with hash 1507, now seen corresponding path program 1 times [2019-11-15 22:08:42,669 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:42,669 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410469271] [2019-11-15 22:08:42,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:42,670 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:42,670 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:42,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:42,686 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:42,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:42,688 INFO L82 PathProgramCache]: Analyzing trace with hash 889568455, now seen corresponding path program 1 times [2019-11-15 22:08:42,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:42,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332585042] [2019-11-15 22:08:42,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:42,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:42,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:42,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:42,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:42,725 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:42,918 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:08:42,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:08:42,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:08:42,919 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:08:42,919 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:08:42,919 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:08:42,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:08:42,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:08:42,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration1_Lasso [2019-11-15 22:08:42,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:08:42,920 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:08:42,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:42,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:42,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:42,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:42,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:42,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:42,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:43,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:43,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:43,391 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:08:43,398 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:08:43,400 INFO L120 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 [2019-11-15 22:08:43,402 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:43,402 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:43,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:43,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:43,403 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:43,405 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:43,405 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:43,409 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:43,410 INFO L120 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 [2019-11-15 22:08:43,411 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:43,412 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:43,412 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:43,412 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:43,412 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:43,413 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:43,413 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:43,415 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:43,418 INFO L120 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 [2019-11-15 22:08:43,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:43,419 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:43,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:43,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:43,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:43,421 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:43,425 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:43,431 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:43,432 INFO L120 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 [2019-11-15 22:08:43,434 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:43,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:43,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:43,436 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:43,441 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:43,441 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:43,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:43,445 INFO L120 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 [2019-11-15 22:08:43,446 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:43,446 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:43,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:43,446 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:43,448 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:43,448 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:43,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:43,452 INFO L120 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 [2019-11-15 22:08:43,453 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:43,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:43,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:43,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:43,479 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:43,480 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:43,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:43,495 INFO L120 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 [2019-11-15 22:08:43,496 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:43,497 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:43,497 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:43,497 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:43,500 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:43,503 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:43,529 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:43,529 INFO L120 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 [2019-11-15 22:08:43,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:43,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:43,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:43,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:43,538 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:43,545 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:43,657 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:08:43,758 INFO L443 ModelExtractionUtils]: Simplification made 7 calls to the SMT solver. [2019-11-15 22:08:43,758 INFO L444 ModelExtractionUtils]: 15 out of 22 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-11-15 22:08:43,760 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:08:43,763 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:08:43,763 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:08:43,764 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~k~0, ULTIMATE.start_main_~array_size~0) = -1*ULTIMATE.start_main_~k~0 + 1*ULTIMATE.start_main_~array_size~0 Supporting invariants [] [2019-11-15 22:08:43,773 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-11-15 22:08:43,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:43,819 INFO L256 TraceCheckSpWp]: Trace formula consists of 25 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:43,821 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:43,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:43,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 10 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:08:43,834 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:43,848 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:43,863 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:08:43,864 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 17 states. Second operand 3 states. [2019-11-15 22:08:43,919 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 17 states.. Second operand 3 states. Result 41 states and 61 transitions. Complement of second has 7 states. [2019-11-15 22:08:43,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:08:43,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:43,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2019-11-15 22:08:43,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 2 letters. [2019-11-15 22:08:43,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:43,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 6 letters. Loop has 2 letters. [2019-11-15 22:08:43,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:43,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 41 transitions. Stem has 4 letters. Loop has 4 letters. [2019-11-15 22:08:43,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:43,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 41 states and 61 transitions. [2019-11-15 22:08:43,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:08:43,942 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 41 states to 14 states and 19 transitions. [2019-11-15 22:08:43,943 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:08:43,944 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 22:08:43,944 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 19 transitions. [2019-11-15 22:08:43,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:08:43,945 INFO L688 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 22:08:43,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states and 19 transitions. [2019-11-15 22:08:43,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-11-15 22:08:43,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 22:08:43,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2019-11-15 22:08:43,969 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 22:08:43,969 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2019-11-15 22:08:43,970 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 22:08:43,970 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2019-11-15 22:08:43,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:08:43,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:43,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:43,971 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:08:43,971 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:08:43,972 INFO L791 eck$LassoCheckResult]: Stem: 127#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 123#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 124#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 128#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 125#L535-3 assume !(main_~k~0 < main_~array_size~0); 126#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 116#L517-3 [2019-11-15 22:08:43,972 INFO L793 eck$LassoCheckResult]: Loop: 116#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 117#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 118#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 122#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 121#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 115#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 116#L517-3 [2019-11-15 22:08:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:43,972 INFO L82 PathProgramCache]: Analyzing trace with hash 889568397, now seen corresponding path program 1 times [2019-11-15 22:08:43,972 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:43,972 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494380600] [2019-11-15 22:08:43,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:43,973 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:43,973 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:43,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:44,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:44,024 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494380600] [2019-11-15 22:08:44,025 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 22:08:44,025 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 22:08:44,025 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091302992] [2019-11-15 22:08:44,027 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:08:44,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:44,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1809463733, now seen corresponding path program 1 times [2019-11-15 22:08:44,028 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:44,028 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865526656] [2019-11-15 22:08:44,028 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,040 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:44,082 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:44,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 22:08:44,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 22:08:44,086 INFO L87 Difference]: Start difference. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 4 states. [2019-11-15 22:08:44,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:44,111 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-11-15 22:08:44,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 22:08:44,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-11-15 22:08:44,113 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:08:44,113 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-11-15 22:08:44,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 22:08:44,114 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 22:08:44,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-11-15 22:08:44,114 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:08:44,114 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-11-15 22:08:44,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-11-15 22:08:44,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-11-15 22:08:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-11-15 22:08:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-11-15 22:08:44,116 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-15 22:08:44,116 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-11-15 22:08:44,116 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 22:08:44,116 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-11-15 22:08:44,117 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 6 [2019-11-15 22:08:44,117 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:44,117 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:44,118 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:44,118 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 22:08:44,118 INFO L791 eck$LassoCheckResult]: Stem: 163#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 159#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 160#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 164#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 161#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 155#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 156#L535-3 assume !(main_~k~0 < main_~array_size~0); 162#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 154#L517-3 [2019-11-15 22:08:44,118 INFO L793 eck$LassoCheckResult]: Loop: 154#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 151#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 152#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 158#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 157#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 153#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 154#L517-3 [2019-11-15 22:08:44,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:44,118 INFO L82 PathProgramCache]: Analyzing trace with hash 176793839, now seen corresponding path program 1 times [2019-11-15 22:08:44,119 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:44,119 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449710092] [2019-11-15 22:08:44,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,119 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,119 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:44,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,158 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:44,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:44,160 INFO L82 PathProgramCache]: Analyzing trace with hash 1809463733, now seen corresponding path program 2 times [2019-11-15 22:08:44,160 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:44,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417307599] [2019-11-15 22:08:44,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,161 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:44,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,180 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:44,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:44,181 INFO L82 PathProgramCache]: Analyzing trace with hash -258934749, now seen corresponding path program 1 times [2019-11-15 22:08:44,181 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:44,181 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840657643] [2019-11-15 22:08:44,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,182 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:44,182 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:44,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:44,209 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:44,519 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 71 [2019-11-15 22:08:44,625 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:08:44,625 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:08:44,625 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:08:44,626 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:08:44,626 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:08:44,626 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:08:44,626 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:08:44,626 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:08:44,626 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration3_Lasso [2019-11-15 22:08:44,626 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:08:44,627 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:08:44,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,846 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 56 [2019-11-15 22:08:44,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,934 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:44,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,315 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:08:45,315 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:08:45,316 INFO L120 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 [2019-11-15 22:08:45,316 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:45,316 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:45,316 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:45,317 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:45,317 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:45,317 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:45,317 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:45,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:45,318 INFO L120 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 [2019-11-15 22:08:45,318 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:45,318 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:45,319 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:45,319 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:45,320 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:45,320 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:45,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:45,338 INFO L120 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 [2019-11-15 22:08:45,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:45,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:45,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:45,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:45,341 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:45,341 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:45,343 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:45,343 INFO L120 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 [2019-11-15 22:08:45,344 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:45,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:45,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:45,344 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:45,345 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:45,345 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:45,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:45,347 INFO L120 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 [2019-11-15 22:08:45,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:45,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:45,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:45,348 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:45,364 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:45,364 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:45,405 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:08:45,455 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:08:45,455 INFO L444 ModelExtractionUtils]: 32 out of 37 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:08:45,456 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:08:45,458 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:08:45,458 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:08:45,458 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_test_fun_~N, ULTIMATE.start_test_fun_~i~0) = 1*ULTIMATE.start_test_fun_~N - 1*ULTIMATE.start_test_fun_~i~0 Supporting invariants [] [2019-11-15 22:08:45,471 INFO L297 tatePredicateManager]: 4 out of 4 supporting invariants were superfluous and have been removed [2019-11-15 22:08:45,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:45,502 INFO L256 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:45,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:45,514 INFO L256 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-15 22:08:45,515 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:45,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:45,532 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:08:45,532 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6 Second operand 3 states. [2019-11-15 22:08:45,565 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 18 transitions. cyclomatic complexity: 6. Second operand 3 states. Result 21 states and 28 transitions. Complement of second has 4 states. [2019-11-15 22:08:45,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2019-11-15 22:08:45,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:45,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 17 transitions. [2019-11-15 22:08:45,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 22:08:45,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:45,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 22:08:45,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:45,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 17 transitions. Stem has 8 letters. Loop has 12 letters. [2019-11-15 22:08:45,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:45,568 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 21 states and 28 transitions. [2019-11-15 22:08:45,569 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:08:45,570 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 21 states to 20 states and 27 transitions. [2019-11-15 22:08:45,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:08:45,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 12 [2019-11-15 22:08:45,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 27 transitions. [2019-11-15 22:08:45,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:08:45,570 INFO L688 BuchiCegarLoop]: Abstraction has 20 states and 27 transitions. [2019-11-15 22:08:45,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states and 27 transitions. [2019-11-15 22:08:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2019-11-15 22:08:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-11-15 22:08:45,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 26 transitions. [2019-11-15 22:08:45,572 INFO L711 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 22:08:45,572 INFO L591 BuchiCegarLoop]: Abstraction has 19 states and 26 transitions. [2019-11-15 22:08:45,572 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 22:08:45,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 19 states and 26 transitions. [2019-11-15 22:08:45,573 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:08:45,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:45,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:45,576 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:45,576 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:08:45,576 INFO L791 eck$LassoCheckResult]: Stem: 281#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 277#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 278#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 282#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 279#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 271#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 272#L535-3 assume !(main_~k~0 < main_~array_size~0); 280#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 270#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 264#L518-3 [2019-11-15 22:08:45,577 INFO L793 eck$LassoCheckResult]: Loop: 264#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 265#L518-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 264#L518-3 [2019-11-15 22:08:45,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:45,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1185641744, now seen corresponding path program 1 times [2019-11-15 22:08:45,577 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:45,577 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764149402] [2019-11-15 22:08:45,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:45,578 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:45,578 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:45,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:45,614 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:45,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:45,616 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 1 times [2019-11-15 22:08:45,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:45,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386357314] [2019-11-15 22:08:45,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:45,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:45,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:45,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:45,628 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:45,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:45,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383701, now seen corresponding path program 1 times [2019-11-15 22:08:45,628 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:45,629 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595326113] [2019-11-15 22:08:45,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:45,629 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:45,629 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:45,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:45,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:45,668 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:45,875 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 75 [2019-11-15 22:08:45,958 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:08:45,958 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:08:45,958 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:08:45,958 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:08:45,958 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:08:45,959 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:08:45,959 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:08:45,959 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:08:45,959 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration4_Lasso [2019-11-15 22:08:45,959 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:08:45,959 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:08:45,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:45,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,133 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-11-15 22:08:46,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,191 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,193 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:46,578 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:08:46,578 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:08:46,578 INFO L120 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 [2019-11-15 22:08:46,579 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:46,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:46,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:46,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:46,579 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:46,579 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:46,580 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:46,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:46,580 INFO L120 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 [2019-11-15 22:08:46,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:46,582 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:46,582 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:46,582 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:46,582 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:46,583 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:46,583 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:46,583 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:46,584 INFO L120 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 [2019-11-15 22:08:46,584 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:46,584 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:46,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:46,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:46,585 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:46,585 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:46,585 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:46,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:46,589 INFO L120 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 [2019-11-15 22:08:46,590 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:46,590 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:46,590 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:46,590 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:46,591 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:46,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:46,594 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:46,597 INFO L120 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 [2019-11-15 22:08:46,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:46,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:46,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:46,602 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:46,604 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:46,604 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:46,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:46,622 INFO L120 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 [2019-11-15 22:08:46,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:46,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:46,623 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:46,623 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:46,625 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:46,625 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:46,635 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:08:46,649 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:08:46,649 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:08:46,650 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:08:46,650 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:08:46,650 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:08:46,650 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_2 Supporting invariants [] [2019-11-15 22:08:46,669 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:08:46,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:08:46,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:46,700 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:46,701 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:46,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:46,707 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:08:46,708 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:46,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:46,719 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:08:46,719 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11 Second operand 3 states. [2019-11-15 22:08:46,746 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 19 states and 26 transitions. cyclomatic complexity: 11. Second operand 3 states. Result 36 states and 47 transitions. Complement of second has 7 states. [2019-11-15 22:08:46,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:08:46,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:46,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 22:08:46,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 2 letters. [2019-11-15 22:08:46,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:46,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-15 22:08:46,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:46,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 9 letters. Loop has 4 letters. [2019-11-15 22:08:46,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:46,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 47 transitions. [2019-11-15 22:08:46,751 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:08:46,752 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 31 states and 42 transitions. [2019-11-15 22:08:46,752 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 14 [2019-11-15 22:08:46,752 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 22:08:46,752 INFO L73 IsDeterministic]: Start isDeterministic. Operand 31 states and 42 transitions. [2019-11-15 22:08:46,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:08:46,752 INFO L688 BuchiCegarLoop]: Abstraction has 31 states and 42 transitions. [2019-11-15 22:08:46,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states and 42 transitions. [2019-11-15 22:08:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-11-15 22:08:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-11-15 22:08:46,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2019-11-15 22:08:46,756 INFO L711 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-15 22:08:46,756 INFO L591 BuchiCegarLoop]: Abstraction has 26 states and 36 transitions. [2019-11-15 22:08:46,756 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 22:08:46,756 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 26 states and 36 transitions. [2019-11-15 22:08:46,757 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:08:46,757 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:46,757 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:46,758 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:46,758 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:08:46,758 INFO L791 eck$LassoCheckResult]: Stem: 420#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 416#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 417#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 421#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 418#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 410#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 411#L535-3 assume !(main_~k~0 < main_~array_size~0); 419#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 407#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 402#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 404#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 413#L522-2 [2019-11-15 22:08:46,759 INFO L793 eck$LassoCheckResult]: Loop: 413#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 412#L522 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 413#L522-2 [2019-11-15 22:08:46,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:46,759 INFO L82 PathProgramCache]: Analyzing trace with hash 1235383699, now seen corresponding path program 1 times [2019-11-15 22:08:46,759 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:46,759 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543451622] [2019-11-15 22:08:46,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:46,759 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:46,759 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:46,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:46,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:46,775 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:46,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:46,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 1 times [2019-11-15 22:08:46,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:46,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496247847] [2019-11-15 22:08:46,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:46,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:46,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:46,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:46,783 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:46,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:46,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1792762584, now seen corresponding path program 1 times [2019-11-15 22:08:46,784 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:46,784 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661332861] [2019-11-15 22:08:46,784 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:46,785 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:46,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:46,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:46,803 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:47,066 WARN L191 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 84 [2019-11-15 22:08:47,129 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:08:47,130 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:08:47,130 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:08:47,130 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:08:47,130 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:08:47,130 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:08:47,130 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:08:47,130 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:08:47,130 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration5_Lasso [2019-11-15 22:08:47,130 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:08:47,130 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:08:47,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,158 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,324 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2019-11-15 22:08:47,377 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,381 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:47,777 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:08:47,777 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:08:47,778 INFO L120 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 [2019-11-15 22:08:47,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,779 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,779 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,779 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,779 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,779 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,781 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,781 INFO L120 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 [2019-11-15 22:08:47,781 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,782 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,782 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,782 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,782 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,782 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,782 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,783 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,783 INFO L120 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 [2019-11-15 22:08:47,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,783 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,785 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,785 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,786 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,787 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,787 INFO L120 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 [2019-11-15 22:08:47,788 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,788 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,788 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,788 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,788 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,789 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,789 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,789 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,790 INFO L120 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 [2019-11-15 22:08:47,790 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,790 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,791 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,791 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,791 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,792 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,793 INFO L120 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 [2019-11-15 22:08:47,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,794 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,794 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,794 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,795 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,795 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,796 INFO L120 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 [2019-11-15 22:08:47,796 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,796 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,797 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,797 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,797 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,798 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,798 INFO L120 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 [2019-11-15 22:08:47,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,799 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,800 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,800 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,800 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,801 INFO L120 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 [2019-11-15 22:08:47,801 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,802 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,802 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,802 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,803 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,803 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,805 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,805 INFO L120 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 [2019-11-15 22:08:47,806 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,806 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,806 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,806 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,806 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,807 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,807 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,807 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,808 INFO L120 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 [2019-11-15 22:08:47,808 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:47,809 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,809 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,809 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,809 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:47,810 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:47,810 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,811 INFO L120 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 [2019-11-15 22:08:47,811 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,811 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,811 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,812 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,812 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,813 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,817 INFO L120 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 [2019-11-15 22:08:47,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,818 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:08:47,818 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,818 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,819 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:08:47,820 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,826 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,827 INFO L120 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 [2019-11-15 22:08:47,827 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,828 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,828 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,828 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,830 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,830 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:47,842 INFO L120 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 [2019-11-15 22:08:47,842 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:47,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:47,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:47,843 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:47,844 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:47,844 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:47,853 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:08:47,861 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 22:08:47,862 INFO L444 ModelExtractionUtils]: 5 out of 10 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 22:08:47,862 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:08:47,863 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:08:47,863 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:08:47,864 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_3 Supporting invariants [] [2019-11-15 22:08:47,883 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:08:47,884 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:08:47,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:47,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:47,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:47,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:08:47,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:47,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:47,942 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:08:47,942 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 26 states and 36 transitions. cyclomatic complexity: 16 Second operand 3 states. [2019-11-15 22:08:47,968 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 26 states and 36 transitions. cyclomatic complexity: 16. Second operand 3 states. Result 35 states and 47 transitions. Complement of second has 7 states. [2019-11-15 22:08:47,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:08:47,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:47,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2019-11-15 22:08:47,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 2 letters. [2019-11-15 22:08:47,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:47,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 13 letters. Loop has 2 letters. [2019-11-15 22:08:47,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:47,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 16 transitions. Stem has 11 letters. Loop has 4 letters. [2019-11-15 22:08:47,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:47,971 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 35 states and 47 transitions. [2019-11-15 22:08:47,972 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:08:47,973 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 35 states to 26 states and 34 transitions. [2019-11-15 22:08:47,973 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:08:47,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:08:47,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 34 transitions. [2019-11-15 22:08:47,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:08:47,974 INFO L688 BuchiCegarLoop]: Abstraction has 26 states and 34 transitions. [2019-11-15 22:08:47,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states and 34 transitions. [2019-11-15 22:08:47,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2019-11-15 22:08:47,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-15 22:08:47,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2019-11-15 22:08:47,977 INFO L711 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 22:08:47,977 INFO L591 BuchiCegarLoop]: Abstraction has 25 states and 33 transitions. [2019-11-15 22:08:47,978 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 22:08:47,978 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 33 transitions. [2019-11-15 22:08:47,979 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:08:47,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:47,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:47,980 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:47,980 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:08:47,980 INFO L791 eck$LassoCheckResult]: Stem: 565#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 561#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 562#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 568#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 563#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 556#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 557#L535-3 assume !(main_~k~0 < main_~array_size~0); 564#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 554#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 555#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 572#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 571#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 560#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 552#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 553#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 548#L518-3 [2019-11-15 22:08:47,980 INFO L793 eck$LassoCheckResult]: Loop: 548#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 549#L518-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 548#L518-3 [2019-11-15 22:08:47,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:47,981 INFO L82 PathProgramCache]: Analyzing trace with hash 562957404, now seen corresponding path program 2 times [2019-11-15 22:08:47,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:47,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655744488] [2019-11-15 22:08:47,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:47,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:47,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:48,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:48,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655744488] [2019-11-15 22:08:48,065 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656933941] [2019-11-15 22:08:48,065 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_70b30d34-d5ba-4ac0-b600-0eea2d0caf4c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 22:08:48,161 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 22:08:48,162 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 22:08:48,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 22:08:48,163 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:48,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:48,272 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 22:08:48,272 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 13 [2019-11-15 22:08:48,272 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492540402] [2019-11-15 22:08:48,272 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 22:08:48,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:48,273 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 2 times [2019-11-15 22:08:48,273 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:48,273 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135600256] [2019-11-15 22:08:48,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:48,273 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:48,273 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:48,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:48,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:48,281 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:48,319 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 22:08:48,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-15 22:08:48,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-11-15 22:08:48,319 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. cyclomatic complexity: 14 Second operand 14 states. [2019-11-15 22:08:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 22:08:48,510 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2019-11-15 22:08:48,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 22:08:48,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 42 states and 53 transitions. [2019-11-15 22:08:48,512 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:08:48,513 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 42 states to 28 states and 35 transitions. [2019-11-15 22:08:48,513 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 11 [2019-11-15 22:08:48,513 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 11 [2019-11-15 22:08:48,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 28 states and 35 transitions. [2019-11-15 22:08:48,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:08:48,513 INFO L688 BuchiCegarLoop]: Abstraction has 28 states and 35 transitions. [2019-11-15 22:08:48,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states and 35 transitions. [2019-11-15 22:08:48,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-15 22:08:48,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-15 22:08:48,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 34 transitions. [2019-11-15 22:08:48,516 INFO L711 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-15 22:08:48,516 INFO L591 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2019-11-15 22:08:48,516 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 22:08:48,516 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states and 34 transitions. [2019-11-15 22:08:48,517 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-11-15 22:08:48,517 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:48,517 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:48,517 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:48,518 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:08:48,518 INFO L791 eck$LassoCheckResult]: Stem: 701#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 698#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 699#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 704#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 696#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 690#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 691#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 697#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 707#L535-3 assume !(main_~k~0 < main_~array_size~0); 700#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 688#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 689#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 708#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 695#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 706#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 686#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 687#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 682#L518-3 [2019-11-15 22:08:48,518 INFO L793 eck$LassoCheckResult]: Loop: 682#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 683#L518-1 assume !!(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3;call test_fun_#t~mem4 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post5 := test_fun_#t~mem4;call write~int(1 + test_fun_#t~post5, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~mem4;havoc test_fun_#t~post5;test_fun_#t~post6 := test_fun_~neg~0;test_fun_~neg~0 := 1 + test_fun_#t~post6;havoc test_fun_#t~post6; 682#L518-3 [2019-11-15 22:08:48,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:48,518 INFO L82 PathProgramCache]: Analyzing trace with hash 131132986, now seen corresponding path program 3 times [2019-11-15 22:08:48,518 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:48,518 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101932758] [2019-11-15 22:08:48,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:48,518 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:48,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:48,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:48,542 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:48,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:48,543 INFO L82 PathProgramCache]: Analyzing trace with hash 2118, now seen corresponding path program 3 times [2019-11-15 22:08:48,543 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:48,543 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396557241] [2019-11-15 22:08:48,543 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:48,544 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:48,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:48,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:48,550 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:48,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:48,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1464749119, now seen corresponding path program 1 times [2019-11-15 22:08:48,551 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:48,551 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666465379] [2019-11-15 22:08:48,551 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:48,552 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:48,552 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:48,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:48,572 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:48,846 WARN L191 SmtUtils]: Spent 235.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 102 [2019-11-15 22:08:48,940 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:08:48,940 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:08:48,940 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:08:48,940 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:08:48,940 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:08:48,940 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:08:48,940 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:08:48,940 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:08:48,940 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration7_Lasso [2019-11-15 22:08:48,940 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:08:48,940 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:08:48,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,947 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:48,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,131 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,140 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:49,441 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:08:49,441 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:08:49,441 INFO L120 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 [2019-11-15 22:08:49,442 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,442 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,442 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,443 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,443 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,443 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,444 INFO L120 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 [2019-11-15 22:08:49,444 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,444 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,444 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,444 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,444 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,444 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,445 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,445 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,445 INFO L120 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 [2019-11-15 22:08:49,445 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,445 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,446 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,446 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,446 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,446 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,447 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,447 INFO L120 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 [2019-11-15 22:08:49,448 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,448 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,449 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,449 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,454 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,454 INFO L120 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 [2019-11-15 22:08:49,455 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,455 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,455 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,455 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,455 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,456 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,456 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,458 INFO L120 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 [2019-11-15 22:08:49,459 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,460 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,460 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,460 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,461 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,463 INFO L120 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 [2019-11-15 22:08:49,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,463 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,464 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,464 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,464 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,464 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,465 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,465 INFO L120 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 [2019-11-15 22:08:49,466 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,466 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,466 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,466 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,466 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,466 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,467 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,467 INFO L120 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 [2019-11-15 22:08:49,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,468 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,468 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,468 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,468 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,469 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,469 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,470 INFO L120 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 [2019-11-15 22:08:49,471 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,471 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,472 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:49,472 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,476 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,476 INFO L120 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 [2019-11-15 22:08:49,477 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,477 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 22:08:49,477 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,477 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,478 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 22:08:49,479 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:49,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:49,492 INFO L120 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 [2019-11-15 22:08:49,493 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:49,493 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:49,493 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:49,493 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:49,493 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:49,494 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:49,494 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:49,496 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:08:49,497 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:08:49,497 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 22:08:49,498 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:08:49,498 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 22:08:49,498 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:08:49,498 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_4) = -1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ (* ULTIMATE.start_test_fun_~i~0 4) ULTIMATE.start_test_fun_~a.offset))_4 Supporting invariants [] [2019-11-15 22:08:49,526 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:08:49,527 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:08:49,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:49,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:49,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:49,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:49,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:08:49,568 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:49,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:49,583 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:08:49,584 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-15 22:08:49,609 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 45 transitions. Complement of second has 7 states. [2019-11-15 22:08:49,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:08:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-15 22:08:49,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-15 22:08:49,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:49,611 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:08:49,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:49,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:49,641 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:49,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:49,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:49,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:08:49,649 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:49,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:49,665 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:08:49,665 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-15 22:08:49,691 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 37 states and 45 transitions. Complement of second has 7 states. [2019-11-15 22:08:49,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:08:49,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:49,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-11-15 22:08:49,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-15 22:08:49,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:49,695 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:08:49,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:49,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:49,736 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:49,737 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:49,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:49,743 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:08:49,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:49,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:49,764 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 2 loop predicates [2019-11-15 22:08:49,764 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13 Second operand 3 states. [2019-11-15 22:08:49,822 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 27 states and 34 transitions. cyclomatic complexity: 13. Second operand 3 states. Result 48 states and 59 transitions. Complement of second has 6 states. [2019-11-15 22:08:49,824 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:08:49,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:49,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-11-15 22:08:49,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 17 letters. Loop has 2 letters. [2019-11-15 22:08:49,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:49,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-15 22:08:49,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:49,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 17 letters. Loop has 4 letters. [2019-11-15 22:08:49,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:49,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 59 transitions. [2019-11-15 22:08:49,827 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:08:49,827 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 38 states and 48 transitions. [2019-11-15 22:08:49,827 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 12 [2019-11-15 22:08:49,827 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-11-15 22:08:49,828 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 48 transitions. [2019-11-15 22:08:49,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 22:08:49,828 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 48 transitions. [2019-11-15 22:08:49,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 48 transitions. [2019-11-15 22:08:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-11-15 22:08:49,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-15 22:08:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2019-11-15 22:08:49,839 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-15 22:08:49,839 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2019-11-15 22:08:49,839 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 22:08:49,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 38 transitions. [2019-11-15 22:08:49,840 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-11-15 22:08:49,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 22:08:49,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 22:08:49,841 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 22:08:49,841 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-11-15 22:08:49,841 INFO L791 eck$LassoCheckResult]: Stem: 1087#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1083#L-1 havoc main_#res;havoc main_#t~nondet11, main_#t~malloc12.base, main_#t~malloc12.offset, main_#t~nondet14, main_#t~post13, main_~k~0, main_~array_size~0, main_~numbers~0.base, main_~numbers~0.offset;main_~array_size~0 := main_#t~nondet11;havoc main_#t~nondet11; 1084#L530 assume !(main_~array_size~0 < 1 || main_~array_size~0 >= 536870911); 1091#L530-2 call main_#t~malloc12.base, main_#t~malloc12.offset := #Ultimate.allocOnStack(4 * main_~array_size~0);main_~numbers~0.base, main_~numbers~0.offset := main_#t~malloc12.base, main_#t~malloc12.offset;main_~k~0 := 0; 1085#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 1077#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 1078#L535-3 assume !!(main_~k~0 < main_~array_size~0);call write~int(main_#t~nondet14, main_~numbers~0.base, main_~numbers~0.offset + 4 * main_~k~0, 4);havoc main_#t~nondet14; 1086#L535-2 main_#t~post13 := main_~k~0;main_~k~0 := 1 + main_#t~post13;havoc main_#t~post13; 1094#L535-3 assume !(main_~k~0 < main_~array_size~0); 1088#L535-4 test_fun_#in~a.base, test_fun_#in~a.offset, test_fun_#in~N := main_~numbers~0.base, main_~numbers~0.offset, main_~array_size~0;havoc test_fun_#t~mem4, test_fun_#t~post5, test_fun_#t~post6, test_fun_#t~mem3, test_fun_#t~mem8, test_fun_#t~post9, test_fun_#t~post10, test_fun_#t~mem7, test_fun_#t~post2, test_fun_~a.base, test_fun_~a.offset, test_fun_~N, test_fun_~i~0, test_fun_~pos~0, test_fun_~neg~0;test_fun_~a.base, test_fun_~a.offset := test_fun_#in~a.base, test_fun_#in~a.offset;test_fun_~N := test_fun_#in~N;havoc test_fun_~i~0;test_fun_~pos~0 := 0;test_fun_~neg~0 := 0;test_fun_~i~0 := 0; 1075#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 1070#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1072#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1082#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1095#L522 assume !(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7; 1073#L517-2 test_fun_#t~post2 := test_fun_~i~0;test_fun_~i~0 := 1 + test_fun_#t~post2;havoc test_fun_#t~post2; 1074#L517-3 assume !!(test_fun_~i~0 < test_fun_~N); 1067#L518-3 call test_fun_#t~mem3 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1069#L518-1 assume !(test_fun_#t~mem3 < 0);havoc test_fun_#t~mem3; 1080#L522-2 [2019-11-15 22:08:49,841 INFO L793 eck$LassoCheckResult]: Loop: 1080#L522-2 call test_fun_#t~mem7 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4); 1079#L522 assume !!(test_fun_#t~mem7 > 0);havoc test_fun_#t~mem7;call test_fun_#t~mem8 := read~int(test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);test_fun_#t~post9 := test_fun_#t~mem8;call write~int(test_fun_#t~post9 - 1, test_fun_~a.base, test_fun_~a.offset + 4 * test_fun_~i~0, 4);havoc test_fun_#t~post9;havoc test_fun_#t~mem8;test_fun_#t~post10 := test_fun_~pos~0;test_fun_~pos~0 := 1 + test_fun_#t~post10;havoc test_fun_#t~post10; 1080#L522-2 [2019-11-15 22:08:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:49,842 INFO L82 PathProgramCache]: Analyzing trace with hash 1464749117, now seen corresponding path program 4 times [2019-11-15 22:08:49,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:49,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734387119] [2019-11-15 22:08:49,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:49,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:49,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:49,864 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:49,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:49,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2502, now seen corresponding path program 2 times [2019-11-15 22:08:49,865 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:49,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157387039] [2019-11-15 22:08:49,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:49,865 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:49,865 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:49,872 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:49,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:49,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1125370110, now seen corresponding path program 1 times [2019-11-15 22:08:49,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 22:08:49,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823521008] [2019-11-15 22:08:49,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:49,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 22:08:49,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 22:08:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:49,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 22:08:49,898 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 22:08:50,377 WARN L191 SmtUtils]: Spent 439.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 115 [2019-11-15 22:08:50,503 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 85 [2019-11-15 22:08:50,505 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 22:08:50,505 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 22:08:50,505 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 22:08:50,505 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 22:08:50,506 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 22:08:50,506 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 22:08:50,506 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 22:08:50,506 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 22:08:50,506 INFO L131 ssoRankerPreferences]: Filename of dumped script: array02-alloca-2.i_Iteration8_Lasso [2019-11-15 22:08:50,506 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 22:08:50,506 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 22:08:50,508 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,513 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,517 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,518 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,521 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,530 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,543 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,545 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,549 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,550 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,553 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,556 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:50,720 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 57 [2019-11-15 22:08:50,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 22:08:51,119 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 22:08:51,119 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 22:08:51,119 INFO L120 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 [2019-11-15 22:08:51,120 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,120 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,120 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,120 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,121 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:51,121 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:51,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,122 INFO L120 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 [2019-11-15 22:08:51,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,123 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,124 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,124 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,124 INFO L120 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 [2019-11-15 22:08:51,125 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,125 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,125 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,125 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,125 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,126 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,126 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,126 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,126 INFO L120 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 [2019-11-15 22:08:51,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,127 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,127 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,127 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,128 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,128 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,128 INFO L120 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 [2019-11-15 22:08:51,129 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,129 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,130 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:51,130 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:51,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,131 INFO L120 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 [2019-11-15 22:08:51,132 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,132 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,132 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,132 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,133 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,133 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,133 INFO L120 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 [2019-11-15 22:08:51,134 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,134 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,134 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,134 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,134 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,135 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,135 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,135 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,135 INFO L120 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 [2019-11-15 22:08:51,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,136 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,136 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,137 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:51,137 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:51,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,138 INFO L120 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 [2019-11-15 22:08:51,139 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,139 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,140 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,140 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,140 INFO L120 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 [2019-11-15 22:08:51,141 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,141 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,141 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,141 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,141 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,142 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,142 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,142 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,142 INFO L120 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 [2019-11-15 22:08:51,143 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,143 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,143 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,144 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,144 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,144 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,144 INFO L120 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 [2019-11-15 22:08:51,145 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,145 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,145 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,145 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,145 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,146 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,146 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,146 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,146 INFO L120 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 [2019-11-15 22:08:51,147 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,147 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,147 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,147 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,148 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:51,148 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:51,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,152 INFO L120 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 [2019-11-15 22:08:51,152 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,153 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,153 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,153 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,153 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,153 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,154 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,154 INFO L120 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 [2019-11-15 22:08:51,154 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,155 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,155 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,155 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,155 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:51,156 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:51,156 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,157 INFO L120 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 [2019-11-15 22:08:51,157 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,157 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,158 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,158 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,158 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,158 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,158 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,159 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,159 INFO L120 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 [2019-11-15 22:08:51,159 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,160 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,160 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,160 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,160 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,160 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,161 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,161 INFO L120 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 [2019-11-15 22:08:51,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,162 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 22:08:51,162 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,162 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,162 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,163 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 22:08:51,163 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 22:08:51,163 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,163 INFO L120 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 [2019-11-15 22:08:51,164 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,164 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,164 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,165 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:51,165 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:51,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,166 INFO L120 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 [2019-11-15 22:08:51,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,167 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,167 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,167 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,168 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:51,168 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:51,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,169 INFO L120 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 [2019-11-15 22:08:51,170 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,170 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,170 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,170 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,171 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:51,171 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:51,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,172 INFO L120 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 [2019-11-15 22:08:51,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,173 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,173 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,173 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,175 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:51,175 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:51,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 22:08:51,183 INFO L120 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 [2019-11-15 22:08:51,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 22:08:51,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 22:08:51,184 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 22:08:51,184 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 22:08:51,185 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 22:08:51,185 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 22:08:51,189 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 22:08:51,191 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 22:08:51,191 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 22:08:51,191 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 22:08:51,192 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 22:08:51,192 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 22:08:51,192 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~a.base) (+ ULTIMATE.start_test_fun_~a.offset (* ULTIMATE.start_test_fun_~i~0 4)))_1 Supporting invariants [] [2019-11-15 22:08:51,212 INFO L297 tatePredicateManager]: 6 out of 6 supporting invariants were superfluous and have been removed [2019-11-15 22:08:51,213 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 22:08:51,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:51,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:51,243 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:51,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:51,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:51,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:08:51,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:51,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:51,266 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:08:51,266 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-15 22:08:51,281 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 34 states and 42 transitions. Complement of second has 7 states. [2019-11-15 22:08:51,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:08:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:51,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 22:08:51,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-15 22:08:51,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:51,283 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:08:51,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:51,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:51,318 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:51,318 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:51,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:51,325 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:08:51,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:51,340 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:51,341 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 2 loop predicates [2019-11-15 22:08:51,341 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-15 22:08:51,351 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 34 states and 42 transitions. Complement of second has 7 states. [2019-11-15 22:08:51,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:08:51,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:51,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 15 transitions. [2019-11-15 22:08:51,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 15 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-15 22:08:51,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:51,352 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 22:08:51,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 22:08:51,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:51,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 22:08:51,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 22:08:51,395 INFO L256 TraceCheckSpWp]: Trace formula consists of 16 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 22:08:51,395 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 22:08:51,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 22:08:51,403 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 2 loop predicates [2019-11-15 22:08:51,403 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14 Second operand 3 states. [2019-11-15 22:08:51,423 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 38 transitions. cyclomatic complexity: 14. Second operand 3 states. Result 36 states and 46 transitions. Complement of second has 6 states. [2019-11-15 22:08:51,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 22:08:51,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-11-15 22:08:51,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 20 transitions. [2019-11-15 22:08:51,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 19 letters. Loop has 2 letters. [2019-11-15 22:08:51,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:51,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 21 letters. Loop has 2 letters. [2019-11-15 22:08:51,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:51,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 20 transitions. Stem has 19 letters. Loop has 4 letters. [2019-11-15 22:08:51,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 22:08:51,425 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 46 transitions. [2019-11-15 22:08:51,425 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:08:51,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 0 states and 0 transitions. [2019-11-15 22:08:51,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 22:08:51,426 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 22:08:51,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 22:08:51,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 22:08:51,426 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:08:51,426 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:08:51,426 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 22:08:51,426 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 22:08:51,426 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 22:08:51,426 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 22:08:51,426 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 22:08:51,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 10:08:51 BoogieIcfgContainer [2019-11-15 22:08:51,431 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 22:08:51,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 22:08:51,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 22:08:51,432 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 22:08:51,432 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 10:08:42" (3/4) ... [2019-11-15 22:08:51,434 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 22:08:51,434 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 22:08:51,435 INFO L168 Benchmark]: Toolchain (without parser) took 9902.21 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 233.8 MB). Free memory was 935.7 MB in the beginning and 947.7 MB in the end (delta: -12.0 MB). Peak memory consumption was 221.9 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:51,436 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:08:51,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 494.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:51,437 INFO L168 Benchmark]: Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:08:51,437 INFO L168 Benchmark]: Boogie Preprocessor took 26.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:51,438 INFO L168 Benchmark]: RCFGBuilder took 352.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:51,438 INFO L168 Benchmark]: BuchiAutomizer took 8981.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 947.7 MB in the end (delta: 158.1 MB). Peak memory consumption was 241.0 MB. Max. memory is 11.5 GB. [2019-11-15 22:08:51,439 INFO L168 Benchmark]: Witness Printer took 2.77 ms. Allocated memory is still 1.3 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 22:08:51,441 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 963.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 494.91 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 935.7 MB in the beginning and 1.1 GB in the end (delta: -197.9 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 40.91 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 26.26 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 352.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.4 MB). Peak memory consumption was 22.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8981.02 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 82.8 MB). Free memory was 1.1 GB in the beginning and 947.7 MB in the end (delta: 158.1 MB). Peak memory consumption was 241.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.77 ms. Allocated memory is still 1.3 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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 8 terminating modules (2 trivial, 4 deterministic, 2 nondeterministic). One deterministic module has affine ranking function -1 * k + array_size and consists of 5 locations. One deterministic module has affine ranking function N + -1 * i and consists of 3 locations. One deterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One nondeterministic module has affine ranking function -1 * unknown-#memory_int-unknown[a][i * 4 + a] and consists of 4 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[a][a + i * 4] and consists of 4 locations. 2 modules have a trivial ranking function, the largest among these consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.9s and 9 iterations. TraceHistogramMax:2. Analysis of lassos took 7.6s. Construction of modules took 0.2s. Büchi inclusion checks took 0.8s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 17 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 30 states and ocurred in iteration 7. Nontrivial modules had stage [4, 0, 2, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 147 SDtfs, 188 SDslu, 122 SDs, 0 SdLazy, 239 SolverSat, 42 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso6 LassoPreprocessingBenchmarks: Lassos: inital173 mio100 ax111 hnf99 lsp82 ukn80 mio100 lsp59 div100 bol100 ite100 ukn100 eq169 hnf91 smp90 dnf100 smp100 tf100 neg100 sie101 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 5 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...