./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/working_dir_28c373c6-6493-4356-a539-5963091662e8/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i -s /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/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 64bit --witnessprinter.graph.data.programhash abee338f12eaa8176313da7ed567414f687b7fa7 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:17,085 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:17,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:17,097 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:17,098 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:17,099 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:17,101 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:17,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:17,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:17,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:17,109 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:17,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:17,115 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:17,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:17,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:17,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:17,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:17,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:17,125 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:17,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:17,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:17,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:17,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:17,136 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:17,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:17,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:17,137 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:17,138 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:17,138 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:17,139 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:17,139 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:17,140 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:17,140 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:17,141 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:17,141 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:17,141 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:17,142 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:17,142 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:17,142 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:17,143 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:17,143 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:17,144 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-10-22 09:00:17,158 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:17,158 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:17,159 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:17,159 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:17,160 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:17,160 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-10-22 09:00:17,160 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-10-22 09:00:17,160 INFO L138 SettingsManager]: * Use old map elimination=false [2019-10-22 09:00:17,160 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-10-22 09:00:17,160 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-10-22 09:00:17,161 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-10-22 09:00:17,161 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:17,161 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-10-22 09:00:17,161 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:17,161 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:17,161 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-10-22 09:00:17,161 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-10-22 09:00:17,162 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-10-22 09:00:17,162 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:17,162 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-10-22 09:00:17,162 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:17,163 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-10-22 09:00:17,163 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:17,163 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:17,163 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-10-22 09:00:17,163 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:17,164 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:17,164 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-10-22 09:00:17,164 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-10-22 09:00:17,165 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/working_dir_28c373c6-6493-4356-a539-5963091662e8/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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> abee338f12eaa8176313da7ed567414f687b7fa7 [2019-10-22 09:00:17,187 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:17,196 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:17,199 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:17,200 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:17,200 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:17,201 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2019-10-22 09:00:17,248 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/bin/uautomizer/data/36848d754/85cacadb070b44beb52b9e54af720229/FLAG768305663 [2019-10-22 09:00:17,675 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:17,675 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/sv-benchmarks/c/termination-memory-alloca/b.18-alloca.i [2019-10-22 09:00:17,685 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/bin/uautomizer/data/36848d754/85cacadb070b44beb52b9e54af720229/FLAG768305663 [2019-10-22 09:00:18,040 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/bin/uautomizer/data/36848d754/85cacadb070b44beb52b9e54af720229 [2019-10-22 09:00:18,043 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:18,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:18,045 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:18,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:18,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:18,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,052 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6072a6c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18, skipping insertion in model container [2019-10-22 09:00:18,052 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,058 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:18,092 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:18,489 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:18,500 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:18,555 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:18,594 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:18,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18 WrapperNode [2019-10-22 09:00:18,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:18,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:18,596 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:18,596 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:18,605 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,641 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:18,641 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:18,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:18,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:18,648 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,649 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,651 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,652 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,656 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,661 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,663 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (1/1) ... [2019-10-22 09:00:18,665 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:18,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:18,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:18,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:18,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/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-10-22 09:00:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-22 09:00:18,739 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:18,739 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:18,975 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:18,976 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-22 09:00:18,977 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:18 BoogieIcfgContainer [2019-10-22 09:00:18,977 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:18,977 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-10-22 09:00:18,977 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-10-22 09:00:18,981 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-10-22 09:00:18,982 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:18,982 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.10 09:00:18" (1/3) ... [2019-10-22 09:00:18,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3028230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:18, skipping insertion in model container [2019-10-22 09:00:18,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:18,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:18" (2/3) ... [2019-10-22 09:00:18,983 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3028230a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.10 09:00:18, skipping insertion in model container [2019-10-22 09:00:18,983 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-10-22 09:00:18,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:18" (3/3) ... [2019-10-22 09:00:18,985 INFO L371 chiAutomizerObserver]: Analyzing ICFG b.18-alloca.i [2019-10-22 09:00:19,075 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-10-22 09:00:19,075 INFO L357 BuchiCegarLoop]: Hoare is false [2019-10-22 09:00:19,075 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-10-22 09:00:19,075 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:19,075 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:19,075 INFO L361 BuchiCegarLoop]: Difference is false [2019-10-22 09:00:19,075 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:19,076 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-10-22 09:00:19,089 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 09:00:19,114 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:00:19,115 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:19,116 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:19,124 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:19,124 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:19,124 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-10-22 09:00:19,124 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17 states. [2019-10-22 09:00:19,125 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:00:19,126 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:19,127 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:19,127 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:19,127 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2019-10-22 09:00:19,135 INFO L791 eck$LassoCheckResult]: Stem: 13#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 11#L-1true havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 8#L559-4true [2019-10-22 09:00:19,135 INFO L793 eck$LassoCheckResult]: Loop: 8#L559-4true call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 14#L553-1true assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 18#L553-3true assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 9#L554true assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 6#L559-3true assume !true; 8#L559-4true [2019-10-22 09:00:19,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:19,142 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-10-22 09:00:19,149 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:19,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724793666] [2019-10-22 09:00:19,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,150 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,150 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:19,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:19,281 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:19,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:19,282 INFO L82 PathProgramCache]: Analyzing trace with hash 35410170, now seen corresponding path program 1 times [2019-10-22 09:00:19,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:19,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1309861631] [2019-10-22 09:00:19,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,283 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,283 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:19,338 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1309861631] [2019-10-22 09:00:19,339 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:19,339 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-10-22 09:00:19,340 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110358926] [2019-10-22 09:00:19,344 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:19,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:19,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:00:19,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:00:19,360 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 2 states. [2019-10-22 09:00:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:19,366 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-10-22 09:00:19,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:00:19,367 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-10-22 09:00:19,369 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:00:19,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 10 states and 14 transitions. [2019-10-22 09:00:19,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 10 [2019-10-22 09:00:19,373 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 10 [2019-10-22 09:00:19,374 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 14 transitions. [2019-10-22 09:00:19,374 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:19,375 INFO L688 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-10-22 09:00:19,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states and 14 transitions. [2019-10-22 09:00:19,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-10-22 09:00:19,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-10-22 09:00:19,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 14 transitions. [2019-10-22 09:00:19,397 INFO L711 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-10-22 09:00:19,397 INFO L591 BuchiCegarLoop]: Abstraction has 10 states and 14 transitions. [2019-10-22 09:00:19,397 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-10-22 09:00:19,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states and 14 transitions. [2019-10-22 09:00:19,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2019-10-22 09:00:19,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:19,398 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:19,398 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:19,398 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:19,399 INFO L791 eck$LassoCheckResult]: Stem: 46#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 42#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 43#L559-4 [2019-10-22 09:00:19,399 INFO L793 eck$LassoCheckResult]: Loop: 43#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 49#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 50#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 51#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 45#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 44#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 43#L559-4 [2019-10-22 09:00:19,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:19,399 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-10-22 09:00:19,399 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:19,400 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442928939] [2019-10-22 09:00:19,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,400 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,400 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:19,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:19,431 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:19,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:19,432 INFO L82 PathProgramCache]: Analyzing trace with hash 1097715097, now seen corresponding path program 1 times [2019-10-22 09:00:19,432 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:19,432 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11846018] [2019-10-22 09:00:19,432 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,433 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,433 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:19,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:19,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11846018] [2019-10-22 09:00:19,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:19,502 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:19,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263383741] [2019-10-22 09:00:19,503 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:19,503 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:19,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:19,504 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:19,504 INFO L87 Difference]: Start difference. First operand 10 states and 14 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-10-22 09:00:19,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:19,630 INFO L93 Difference]: Finished difference Result 17 states and 23 transitions. [2019-10-22 09:00:19,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:19,632 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17 states and 23 transitions. [2019-10-22 09:00:19,633 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2019-10-22 09:00:19,633 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17 states to 17 states and 23 transitions. [2019-10-22 09:00:19,633 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 09:00:19,634 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2019-10-22 09:00:19,634 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 23 transitions. [2019-10-22 09:00:19,634 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:19,634 INFO L688 BuchiCegarLoop]: Abstraction has 17 states and 23 transitions. [2019-10-22 09:00:19,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 23 transitions. [2019-10-22 09:00:19,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2019-10-22 09:00:19,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-10-22 09:00:19,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 16 transitions. [2019-10-22 09:00:19,636 INFO L711 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:00:19,636 INFO L591 BuchiCegarLoop]: Abstraction has 12 states and 16 transitions. [2019-10-22 09:00:19,636 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-10-22 09:00:19,636 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 16 transitions. [2019-10-22 09:00:19,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 10 [2019-10-22 09:00:19,637 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:19,637 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:19,638 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:19,638 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:19,638 INFO L791 eck$LassoCheckResult]: Stem: 83#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 79#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 80#L559-4 [2019-10-22 09:00:19,639 INFO L793 eck$LassoCheckResult]: Loop: 80#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 86#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 87#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 89#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 84#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 85#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 80#L559-4 [2019-10-22 09:00:19,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:19,639 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-10-22 09:00:19,639 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:19,639 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880496144] [2019-10-22 09:00:19,639 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,640 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:19,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:19,687 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:19,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:19,688 INFO L82 PathProgramCache]: Analyzing trace with hash 1097700202, now seen corresponding path program 1 times [2019-10-22 09:00:19,688 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:19,688 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777094815] [2019-10-22 09:00:19,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,689 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,689 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:19,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:19,759 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777094815] [2019-10-22 09:00:19,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:19,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:19,760 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523965689] [2019-10-22 09:00:19,760 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:19,760 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:19,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:19,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:19,761 INFO L87 Difference]: Start difference. First operand 12 states and 16 transitions. cyclomatic complexity: 5 Second operand 5 states. [2019-10-22 09:00:19,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:19,809 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2019-10-22 09:00:19,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:19,810 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 15 states and 19 transitions. [2019-10-22 09:00:19,811 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-10-22 09:00:19,811 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 15 states to 15 states and 19 transitions. [2019-10-22 09:00:19,812 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-10-22 09:00:19,812 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-10-22 09:00:19,812 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 19 transitions. [2019-10-22 09:00:19,812 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:19,812 INFO L688 BuchiCegarLoop]: Abstraction has 15 states and 19 transitions. [2019-10-22 09:00:19,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 19 transitions. [2019-10-22 09:00:19,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2019-10-22 09:00:19,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-10-22 09:00:19,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 18 transitions. [2019-10-22 09:00:19,815 INFO L711 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 09:00:19,815 INFO L591 BuchiCegarLoop]: Abstraction has 14 states and 18 transitions. [2019-10-22 09:00:19,815 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-10-22 09:00:19,815 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 18 transitions. [2019-10-22 09:00:19,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 12 [2019-10-22 09:00:19,816 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:19,816 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:19,816 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:19,816 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:19,816 INFO L791 eck$LassoCheckResult]: Stem: 120#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 116#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 117#L559-4 [2019-10-22 09:00:19,817 INFO L793 eck$LassoCheckResult]: Loop: 117#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 121#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 122#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 126#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 123#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 124#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 128#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 129#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 117#L559-4 [2019-10-22 09:00:19,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:19,817 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-10-22 09:00:19,817 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:19,817 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345353964] [2019-10-22 09:00:19,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,818 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,818 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:19,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:19,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:19,839 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:19,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:19,840 INFO L82 PathProgramCache]: Analyzing trace with hash -1672057937, now seen corresponding path program 1 times [2019-10-22 09:00:19,840 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:19,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798617249] [2019-10-22 09:00:19,840 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,841 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:19,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:19,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:19,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798617249] [2019-10-22 09:00:19,909 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1165945203] [2019-10-22 09:00:19,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_28c373c6-6493-4356-a539-5963091662e8/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-10-22 09:00:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:19,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-22 09:00:19,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:19,987 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:20,113 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:20,114 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 38 treesize of output 63 [2019-10-22 09:00:20,115 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:20,117 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:20,119 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:20,148 INFO L567 ElimStorePlain]: treesize reduction 35, result has 44.4 percent of original size [2019-10-22 09:00:20,149 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-22 09:00:20,149 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:38, output treesize:27 [2019-10-22 09:00:20,177 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:20,189 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:20,190 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 14 [2019-10-22 09:00:20,191 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:20,197 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2019-10-22 09:00:20,198 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:20,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:20,213 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:00:20,213 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:61, output treesize:3 [2019-10-22 09:00:20,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:20,215 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-22 09:00:20,215 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2019-10-22 09:00:20,215 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846286479] [2019-10-22 09:00:20,216 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-10-22 09:00:20,216 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:20,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:00:20,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:20,217 INFO L87 Difference]: Start difference. First operand 14 states and 18 transitions. cyclomatic complexity: 5 Second operand 10 states. [2019-10-22 09:00:32,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:32,512 INFO L93 Difference]: Finished difference Result 16 states and 20 transitions. [2019-10-22 09:00:32,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-22 09:00:32,513 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 16 states and 20 transitions. [2019-10-22 09:00:32,514 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 09:00:32,514 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 16 states to 16 states and 20 transitions. [2019-10-22 09:00:32,514 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2019-10-22 09:00:32,515 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2019-10-22 09:00:32,515 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 20 transitions. [2019-10-22 09:00:32,515 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:32,515 INFO L688 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 09:00:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states and 20 transitions. [2019-10-22 09:00:32,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-10-22 09:00:32,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-10-22 09:00:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2019-10-22 09:00:32,517 INFO L711 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 09:00:32,517 INFO L591 BuchiCegarLoop]: Abstraction has 16 states and 20 transitions. [2019-10-22 09:00:32,517 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-10-22 09:00:32,517 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 16 states and 20 transitions. [2019-10-22 09:00:32,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 14 [2019-10-22 09:00:32,518 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:32,518 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:32,518 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-10-22 09:00:32,518 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:32,519 INFO L791 eck$LassoCheckResult]: Stem: 194#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 190#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 191#L559-4 [2019-10-22 09:00:32,519 INFO L793 eck$LassoCheckResult]: Loop: 191#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 195#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 196#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 200#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 201#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 192#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 193#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 199#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 191#L559-4 [2019-10-22 09:00:32,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,519 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-10-22 09:00:32,519 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1307969745] [2019-10-22 09:00:32,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,520 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,538 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:32,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,539 INFO L82 PathProgramCache]: Analyzing trace with hash -1657743362, now seen corresponding path program 1 times [2019-10-22 09:00:32,539 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,539 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019642080] [2019-10-22 09:00:32,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,539 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,571 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:32,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:32,571 INFO L82 PathProgramCache]: Analyzing trace with hash -967181888, now seen corresponding path program 1 times [2019-10-22 09:00:32,571 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:32,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094141918] [2019-10-22 09:00:32,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,572 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:32,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:32,622 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:32,767 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 54 [2019-10-22 09:00:32,991 WARN L191 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 68 [2019-10-22 09:00:33,089 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:33,090 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:33,090 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:33,090 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:33,090 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:33,091 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:33,091 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:33,091 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:33,091 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration5_Lasso [2019-10-22 09:00:33,091 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:33,091 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:33,109 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,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-10-22 09:00:33,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-10-22 09:00:33,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,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-10-22 09:00:33,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-10-22 09:00:33,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,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-10-22 09:00:33,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-10-22 09:00:33,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,369 WARN L191 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 55 [2019-10-22 09:00:33,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:33,815 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:00:33,905 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:33,914 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:33,916 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-10-22 09:00:33,918 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,918 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,919 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,919 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,919 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,921 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,922 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,923 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,924 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-10-22 09:00:33,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,925 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,926 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,927 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,928 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-10-22 09:00:33,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,929 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,929 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,929 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,929 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,930 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,930 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,935 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,936 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-10-22 09:00:33,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,937 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,938 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,938 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,939 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,939 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-10-22 09:00:33,940 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,940 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,940 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,940 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,942 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,942 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,953 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-10-22 09:00:33,954 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,954 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,955 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,955 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,955 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,956 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-10-22 09:00:33,957 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,957 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,957 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,957 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,957 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,957 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,958 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,958 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,961 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-10-22 09:00:33,962 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,963 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,964 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,964 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,965 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,966 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,970 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,975 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-10-22 09:00:33,978 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,979 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,980 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,980 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,985 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-10-22 09:00:33,986 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,986 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,986 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,986 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,986 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,987 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,987 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,988 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,988 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-10-22 09:00:33,988 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,989 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,989 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,989 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,991 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-10-22 09:00:33,991 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,991 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,992 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,992 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,992 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,992 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:33,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:33,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,993 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-10-22 09:00:33,994 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:33,996 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:33,996 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:33,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:33,998 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-10-22 09:00:33,999 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:33,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:33,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:33,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:33,999 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,000 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,000 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,001 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,001 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-10-22 09:00:34,001 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,002 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,002 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,002 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,002 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,003 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,003 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,003 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,004 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-10-22 09:00:34,004 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,004 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,004 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,004 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,005 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,005 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,005 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,006 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,006 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-10-22 09:00:34,007 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,007 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,007 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,007 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,008 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,008 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,009 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-10-22 09:00:34,009 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,009 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,010 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,010 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,010 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,011 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,011 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-10-22 09:00:34,012 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,012 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,012 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,012 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,012 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,013 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,013 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,014 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-10-22 09:00:34,014 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,015 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,015 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,015 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,016 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,016 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,019 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-10-22 09:00:34,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,019 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:34,020 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,020 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,020 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,020 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:34,020 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:34,021 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,021 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-10-22 09:00:34,022 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,022 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,022 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,022 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,024 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,024 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,031 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,031 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-10-22 09:00:34,032 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,032 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,032 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,032 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,034 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,034 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,041 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-10-22 09:00:34,042 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,042 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:00:34,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,042 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,045 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:34,045 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:34,060 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-10-22 09:00:34,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:34,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:34,061 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:34,061 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:34,064 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:34,065 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:34,082 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:34,109 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-10-22 09:00:34,109 INFO L444 ModelExtractionUtils]: 21 out of 28 variables were initially zero. Simplification set additionally 5 variables to zero. [2019-10-22 09:00:34,111 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:34,112 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:34,112 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:34,113 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 Supporting invariants [] [2019-10-22 09:00:34,139 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 09:00:34,145 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:34,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:34,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:34,184 INFO L256 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:34,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:34,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-22 09:00:34,193 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2019-10-22 09:00:34,193 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:34,209 INFO L567 ElimStorePlain]: treesize reduction 1, result has 94.7 percent of original size [2019-10-22 09:00:34,212 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2019-10-22 09:00:34,212 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:34,217 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:34,218 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-10-22 09:00:34,218 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:6 [2019-10-22 09:00:34,247 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-22 09:00:34,251 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 09:00:34,251 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5 Second operand 6 states. [2019-10-22 09:00:34,400 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 16 states and 20 transitions. cyclomatic complexity: 5. Second operand 6 states. Result 40 states and 53 transitions. Complement of second has 10 states. [2019-10-22 09:00:34,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:34,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-10-22 09:00:34,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 22 transitions. [2019-10-22 09:00:34,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 8 letters. [2019-10-22 09:00:34,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:34,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 10 letters. Loop has 8 letters. [2019-10-22 09:00:34,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:34,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 22 transitions. Stem has 2 letters. Loop has 16 letters. [2019-10-22 09:00:34,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:34,406 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 40 states and 53 transitions. [2019-10-22 09:00:34,408 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 09:00:34,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 40 states to 38 states and 51 transitions. [2019-10-22 09:00:34,413 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 18 [2019-10-22 09:00:34,413 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:00:34,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 38 states and 51 transitions. [2019-10-22 09:00:34,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:34,413 INFO L688 BuchiCegarLoop]: Abstraction has 38 states and 51 transitions. [2019-10-22 09:00:34,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states and 51 transitions. [2019-10-22 09:00:34,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2019-10-22 09:00:34,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 09:00:34,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2019-10-22 09:00:34,417 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 09:00:34,417 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 39 transitions. [2019-10-22 09:00:34,417 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-10-22 09:00:34,417 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 39 transitions. [2019-10-22 09:00:34,417 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 12 [2019-10-22 09:00:34,417 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:34,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:34,418 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-10-22 09:00:34,418 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 2, 1, 1, 1, 1, 1] [2019-10-22 09:00:34,418 INFO L791 eck$LassoCheckResult]: Stem: 362#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 354#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 355#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 367#L553-1 [2019-10-22 09:00:34,420 INFO L793 eck$LassoCheckResult]: Loop: 367#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 368#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 371#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 363#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 364#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 373#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 380#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 379#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 378#L555-1 assume !(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9; 357#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 367#L553-1 [2019-10-22 09:00:34,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,420 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-10-22 09:00:34,421 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,421 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187406219] [2019-10-22 09:00:34,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,421 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,421 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,459 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1479493138, now seen corresponding path program 2 times [2019-10-22 09:00:34,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,460 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873597478] [2019-10-22 09:00:34,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,460 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,480 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:34,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:34,480 INFO L82 PathProgramCache]: Analyzing trace with hash 376307409, now seen corresponding path program 1 times [2019-10-22 09:00:34,480 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:34,480 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400386253] [2019-10-22 09:00:34,480 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,481 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:34,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:34,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:34,503 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:34,649 WARN L191 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 64 [2019-10-22 09:00:34,899 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 79 [2019-10-22 09:00:35,145 WARN L191 SmtUtils]: Spent 245.00 ms on a formula simplification that was a NOOP. DAG size: 76 [2019-10-22 09:00:35,147 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:35,148 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:35,148 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:35,148 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:35,148 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:35,148 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:35,148 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:35,148 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:35,148 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration6_Lasso [2019-10-22 09:00:35,148 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:35,148 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:35,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,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-10-22 09:00:35,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,176 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,180 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,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-10-22 09:00:35,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,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-10-22 09:00:35,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-10-22 09:00:35,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,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-10-22 09:00:35,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:35,609 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-22 09:00:36,166 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 35 DAG size of output: 33 [2019-10-22 09:00:36,287 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:36,287 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:36,288 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-10-22 09:00:36,288 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,288 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,289 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,289 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,289 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,289 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,289 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,290 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,291 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-10-22 09:00:36,291 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,291 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,291 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,291 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,291 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,292 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,292 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,292 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,293 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-10-22 09:00:36,293 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,293 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,293 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,293 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,293 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,293 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,294 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,294 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,295 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-10-22 09:00:36,295 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,295 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,296 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,296 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,296 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,298 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,298 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-10-22 09:00:36,299 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,299 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,299 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,300 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,300 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,302 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,302 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-10-22 09:00:36,303 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,303 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,303 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,303 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,304 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,304 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,305 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,305 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-10-22 09:00:36,306 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,307 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,307 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,307 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,307 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,308 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-10-22 09:00:36,308 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,308 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,308 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,309 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,309 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,309 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,309 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,309 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,310 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-10-22 09:00:36,310 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,311 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,311 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,311 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,311 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,311 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,311 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,312 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,312 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-10-22 09:00:36,313 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,313 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,313 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,313 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,313 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,313 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,313 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,314 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,314 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-10-22 09:00:36,315 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,315 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,315 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,315 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,315 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,316 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,316 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,316 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,317 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-10-22 09:00:36,317 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,317 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,317 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,317 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,318 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,318 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,319 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,320 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-10-22 09:00:36,320 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,320 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,321 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,321 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,321 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,321 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,322 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,322 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-10-22 09:00:36,322 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,323 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,323 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,323 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,323 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,323 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,323 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,324 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,324 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-10-22 09:00:36,324 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,325 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,325 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,325 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,325 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,325 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,325 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,326 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,327 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-10-22 09:00:36,327 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,327 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,327 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,327 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,328 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,328 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,329 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,330 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-10-22 09:00:36,330 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,330 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,331 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,331 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,331 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,332 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,332 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-10-22 09:00:36,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,332 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,333 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,333 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,334 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,334 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-10-22 09:00:36,335 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,335 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,335 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,335 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,335 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,335 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,335 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,336 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-10-22 09:00:36,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:36,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,337 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,337 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:36,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:36,338 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,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-10-22 09:00:36,339 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,339 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,339 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,339 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,340 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,340 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,342 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-10-22 09:00:36,343 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,343 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,343 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,343 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,344 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,345 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,362 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-10-22 09:00:36,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:36,363 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,364 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,364 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:36,364 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,372 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:36,373 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-10-22 09:00:36,373 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:36,373 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-10-22 09:00:36,373 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:36,373 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:36,377 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-10-22 09:00:36,383 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:36,419 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:36,451 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:36,452 INFO L444 ModelExtractionUtils]: 31 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:36,452 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:36,453 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:36,454 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:36,454 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(ite ULTIMATE.start_test_fun_#t~short6 1 0)_2) = 1*v_rep(ite ULTIMATE.start_test_fun_#t~short6 1 0)_2 Supporting invariants [] [2019-10-22 09:00:36,484 INFO L297 tatePredicateManager]: 11 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 09:00:36,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:36,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:36,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-22 09:00:36,520 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:36,547 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-22 09:00:36,547 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-10-22 09:00:36,547 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12 Second operand 5 states. [2019-10-22 09:00:36,621 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 39 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 73 states and 98 transitions. Complement of second has 10 states. [2019-10-22 09:00:36,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2019-10-22 09:00:36,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-10-22 09:00:36,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 20 transitions. [2019-10-22 09:00:36,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 10 letters. [2019-10-22 09:00:36,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 13 letters. Loop has 10 letters. [2019-10-22 09:00:36,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 20 transitions. Stem has 3 letters. Loop has 20 letters. [2019-10-22 09:00:36,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:36,623 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 73 states and 98 transitions. [2019-10-22 09:00:36,625 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:36,626 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 73 states to 65 states and 89 transitions. [2019-10-22 09:00:36,626 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2019-10-22 09:00:36,626 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 20 [2019-10-22 09:00:36,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 89 transitions. [2019-10-22 09:00:36,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:36,629 INFO L688 BuchiCegarLoop]: Abstraction has 65 states and 89 transitions. [2019-10-22 09:00:36,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 89 transitions. [2019-10-22 09:00:36,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 55. [2019-10-22 09:00:36,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2019-10-22 09:00:36,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 79 transitions. [2019-10-22 09:00:36,632 INFO L711 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2019-10-22 09:00:36,632 INFO L591 BuchiCegarLoop]: Abstraction has 55 states and 79 transitions. [2019-10-22 09:00:36,632 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-10-22 09:00:36,632 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 55 states and 79 transitions. [2019-10-22 09:00:36,633 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:36,633 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:36,633 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:36,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:36,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:36,634 INFO L791 eck$LassoCheckResult]: Stem: 579#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 571#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 572#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 615#L553-1 assume !test_fun_#t~short6; 585#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 590#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 580#L555-3 [2019-10-22 09:00:36,634 INFO L793 eck$LassoCheckResult]: Loop: 580#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 581#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 580#L555-3 [2019-10-22 09:00:36,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,634 INFO L82 PathProgramCache]: Analyzing trace with hash 889571371, now seen corresponding path program 1 times [2019-10-22 09:00:36,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60317579] [2019-10-22 09:00:36,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:36,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:36,654 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60317579] [2019-10-22 09:00:36,654 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:36,654 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:36,654 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [591769889] [2019-10-22 09:00:36,654 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:36,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,654 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 1 times [2019-10-22 09:00:36,655 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,655 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704457442] [2019-10-22 09:00:36,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,655 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,663 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:36,688 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:36,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-22 09:00:36,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-22 09:00:36,689 INFO L87 Difference]: Start difference. First operand 55 states and 79 transitions. cyclomatic complexity: 30 Second operand 3 states. [2019-10-22 09:00:36,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:36,697 INFO L93 Difference]: Finished difference Result 59 states and 75 transitions. [2019-10-22 09:00:36,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-22 09:00:36,699 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 59 states and 75 transitions. [2019-10-22 09:00:36,700 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:36,701 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 59 states to 53 states and 67 transitions. [2019-10-22 09:00:36,701 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 13 [2019-10-22 09:00:36,701 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 13 [2019-10-22 09:00:36,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 53 states and 67 transitions. [2019-10-22 09:00:36,701 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:36,701 INFO L688 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-10-22 09:00:36,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states and 67 transitions. [2019-10-22 09:00:36,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-22 09:00:36,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 09:00:36,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 67 transitions. [2019-10-22 09:00:36,710 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-10-22 09:00:36,710 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 67 transitions. [2019-10-22 09:00:36,710 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-10-22 09:00:36,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 67 transitions. [2019-10-22 09:00:36,710 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:36,711 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:36,711 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:36,711 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-10-22 09:00:36,711 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:36,711 INFO L791 eck$LassoCheckResult]: Stem: 699#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 691#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 692#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 737#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 705#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 710#L554 assume test_fun_#t~mem7 > test_fun_#t~mem8;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 700#L555-3 [2019-10-22 09:00:36,711 INFO L793 eck$LassoCheckResult]: Loop: 700#L555-3 call test_fun_#t~mem9 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); 701#L555-1 assume !!(test_fun_#t~mem9 > 0);havoc test_fun_#t~mem9;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_#t~mem10 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem10; 700#L555-3 [2019-10-22 09:00:36,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,711 INFO L82 PathProgramCache]: Analyzing trace with hash 889569449, now seen corresponding path program 1 times [2019-10-22 09:00:36,712 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240959668] [2019-10-22 09:00:36,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,712 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,712 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,723 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:36,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1798, now seen corresponding path program 2 times [2019-10-22 09:00:36,724 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,724 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486401755] [2019-10-22 09:00:36,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,724 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,724 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,729 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:36,729 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:36,729 INFO L82 PathProgramCache]: Analyzing trace with hash 177749422, now seen corresponding path program 1 times [2019-10-22 09:00:36,730 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:36,730 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361113328] [2019-10-22 09:00:36,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,730 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:36,730 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:36,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:36,744 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:36,989 WARN L191 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 84 [2019-10-22 09:00:37,066 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:37,066 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:37,066 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:37,067 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:37,067 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:37,067 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:37,067 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:37,067 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:37,067 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration8_Lasso [2019-10-22 09:00:37,067 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:37,067 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:37,069 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,071 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,083 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,085 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:37,254 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 57 [2019-10-22 09:00:37,571 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:00:37,645 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:37,645 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:37,645 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-10-22 09:00:37,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,646 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,647 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,648 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-10-22 09:00:37,648 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,648 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,649 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,649 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,649 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,650 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-10-22 09:00:37,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,650 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,651 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,651 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,651 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,652 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,652 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-10-22 09:00:37,653 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,653 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,653 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,653 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,654 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,654 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,656 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-10-22 09:00:37,656 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,656 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,656 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,656 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,657 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,657 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,657 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,657 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,658 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-10-22 09:00:37,658 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,658 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,659 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,659 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,659 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,660 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,661 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,661 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-10-22 09:00:37,662 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,662 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,662 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,662 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,662 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,663 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,663 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,663 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,664 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-10-22 09:00:37,664 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,664 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,664 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,664 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,664 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,665 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,665 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,665 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,666 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-10-22 09:00:37,666 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,666 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,667 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,667 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,667 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,667 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,667 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,668 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,668 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-10-22 09:00:37,668 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,669 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,669 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,669 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,669 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,669 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,671 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,671 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-10-22 09:00:37,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,672 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,672 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,673 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,673 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,673 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-10-22 09:00:37,674 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,674 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,674 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,674 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,675 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,675 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,675 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,675 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,676 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-10-22 09:00:37,676 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,676 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,676 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,676 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,677 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,677 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,677 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,677 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,678 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-10-22 09:00:37,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,678 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,703 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,703 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,703 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,704 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-10-22 09:00:37,704 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,704 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,704 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,705 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,705 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,705 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,705 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,706 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-10-22 09:00:37,706 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,708 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,708 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,709 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,709 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,709 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,709 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,710 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-10-22 09:00:37,710 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,711 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,711 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,711 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,711 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,711 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,713 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,713 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-10-22 09:00:37,713 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,714 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,714 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,715 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,715 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,715 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,715 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,717 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-10-22 09:00:37,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,718 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,718 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,718 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,718 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,719 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,719 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,719 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-10-22 09:00:37,719 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,720 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,720 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,720 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,720 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,720 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,720 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,721 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-10-22 09:00:37,721 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,721 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-10-22 09:00:37,721 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,721 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,722 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,722 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-10-22 09:00:37,722 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-10-22 09:00:37,723 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,723 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-10-22 09:00:37,723 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,723 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,724 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,724 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,724 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,724 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,726 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,727 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-10-22 09:00:37,727 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,727 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,727 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,727 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,728 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,728 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,731 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,731 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-10-22 09:00:37,732 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,732 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,733 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,733 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,736 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,736 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-10-22 09:00:37,737 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,737 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:00:37,737 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,737 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,739 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:37,739 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,746 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:37,746 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-10-22 09:00:37,747 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:37,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:37,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:37,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:37,748 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:37,749 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:37,757 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:37,767 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2019-10-22 09:00:37,767 INFO L444 ModelExtractionUtils]: 22 out of 28 variables were initially zero. Simplification set additionally 4 variables to zero. [2019-10-22 09:00:37,767 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:37,768 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-10-22 09:00:37,768 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:37,768 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_3 Supporting invariants [] [2019-10-22 09:00:37,791 INFO L297 tatePredicateManager]: 10 out of 10 supporting invariants were superfluous and have been removed [2019-10-22 09:00:37,792 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:37,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-22 09:00:37,820 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:37,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 14 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-22 09:00:37,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:37,835 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:37,835 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-10-22 09:00:37,835 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20 Second operand 3 states. [2019-10-22 09:00:37,864 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 67 transitions. cyclomatic complexity: 20. Second operand 3 states. Result 149 states and 188 transitions. Complement of second has 6 states. [2019-10-22 09:00:37,864 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-10-22 09:00:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2019-10-22 09:00:37,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 2 letters. [2019-10-22 09:00:37,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:37,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 8 letters. Loop has 2 letters. [2019-10-22 09:00:37,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:37,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 22 transitions. Stem has 6 letters. Loop has 4 letters. [2019-10-22 09:00:37,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:37,865 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 149 states and 188 transitions. [2019-10-22 09:00:37,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 4 [2019-10-22 09:00:37,868 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 149 states to 56 states and 67 transitions. [2019-10-22 09:00:37,868 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 7 [2019-10-22 09:00:37,868 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 7 [2019-10-22 09:00:37,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 67 transitions. [2019-10-22 09:00:37,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:37,868 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 67 transitions. [2019-10-22 09:00:37,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 67 transitions. [2019-10-22 09:00:37,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 30. [2019-10-22 09:00:37,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-22 09:00:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2019-10-22 09:00:37,870 INFO L711 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-10-22 09:00:37,871 INFO L591 BuchiCegarLoop]: Abstraction has 30 states and 37 transitions. [2019-10-22 09:00:37,871 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-10-22 09:00:37,871 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 30 states and 37 transitions. [2019-10-22 09:00:37,872 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:37,872 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:37,872 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:37,872 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:37,872 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:37,872 INFO L791 eck$LassoCheckResult]: Stem: 986#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 980#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 981#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 993#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1002#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1001#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1000#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 999#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 997#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 982#L559-1 [2019-10-22 09:00:37,873 INFO L793 eck$LassoCheckResult]: Loop: 982#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 983#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 982#L559-1 [2019-10-22 09:00:37,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1215726572, now seen corresponding path program 1 times [2019-10-22 09:00:37,873 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,873 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019256246] [2019-10-22 09:00:37,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,873 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,873 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,896 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,901 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 1 times [2019-10-22 09:00:37,901 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,901 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005166036] [2019-10-22 09:00:37,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,901 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,907 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:37,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:37,908 INFO L82 PathProgramCache]: Analyzing trace with hash 82132647, now seen corresponding path program 2 times [2019-10-22 09:00:37,908 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:37,908 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090191569] [2019-10-22 09:00:37,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,908 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:37,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:37,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:37,923 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:38,266 WARN L191 SmtUtils]: Spent 319.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2019-10-22 09:00:38,361 INFO L210 LassoAnalysis]: Preferences: [2019-10-22 09:00:38,361 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-10-22 09:00:38,361 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-10-22 09:00:38,361 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-10-22 09:00:38,361 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-10-22 09:00:38,361 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-10-22 09:00:38,361 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-10-22 09:00:38,362 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-10-22 09:00:38,362 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.18-alloca.i_Iteration9_Lasso [2019-10-22 09:00:38,362 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-10-22 09:00:38,362 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-10-22 09:00:38,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,514 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 65 [2019-10-22 09:00:38,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,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-10-22 09:00:38,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,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-10-22 09:00:38,540 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,541 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,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-10-22 09:00:38,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-10-22 09:00:38,544 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,546 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,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-10-22 09:00:38,548 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,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-10-22 09:00:38,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-10-22 09:00:38,552 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,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-10-22 09:00:38,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,567 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,569 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-10-22 09:00:38,881 WARN L191 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 25 [2019-10-22 09:00:38,982 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-10-22 09:00:38,983 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-10-22 09:00:38,983 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-10-22 09:00:38,983 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,984 INFO L202 nArgumentSynthesizer]: 4 stem disjuncts [2019-10-22 09:00:38,984 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,984 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,985 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-10-22 09:00:38,985 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:38,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:38,993 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-10-22 09:00:38,993 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:38,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:38,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:38,994 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:38,996 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:38,996 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:39,002 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:39,002 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-10-22 09:00:39,003 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:39,003 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:39,003 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:39,003 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:39,004 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:39,004 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:39,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:39,005 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-10-22 09:00:39,006 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:39,006 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:39,006 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:39,006 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:39,007 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:39,007 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:39,010 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:39,010 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-10-22 09:00:39,011 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:39,011 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:39,011 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:39,011 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:39,012 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:39,012 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:39,013 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-10-22 09:00:39,013 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-10-22 09:00:39,013 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-10-22 09:00:39,013 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-10-22 09:00:39,014 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-10-22 09:00:39,014 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-10-22 09:00:39,015 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-10-22 09:00:39,016 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-10-22 09:00:39,036 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-10-22 09:00:39,047 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-10-22 09:00:39,047 INFO L444 ModelExtractionUtils]: 26 out of 31 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-10-22 09:00:39,047 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-10-22 09:00:39,048 INFO L438 nArgumentSynthesizer]: Removed 1 redundant supporting invariants from a total of 2. [2019-10-22 09:00:39,048 INFO L510 LassoAnalysis]: Proved termination. [2019-10-22 09:00:39,049 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 Supporting invariants [-1*ULTIMATE.start_test_fun_#t~mem11 + 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_4 >= 0] [2019-10-22 09:00:39,086 INFO L297 tatePredicateManager]: 10 out of 11 supporting invariants were superfluous and have been removed [2019-10-22 09:00:39,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:39,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:39,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:39,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-22 09:00:39,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:39,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-22 09:00:39,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-22 09:00:39,135 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 16 [2019-10-22 09:00:39,136 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-22 09:00:39,140 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-22 09:00:39,140 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-22 09:00:39,140 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-10-22 09:00:39,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:39,153 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-10-22 09:00:39,153 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10 Second operand 3 states. [2019-10-22 09:00:39,187 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 30 states and 37 transitions. cyclomatic complexity: 10. Second operand 3 states. Result 61 states and 75 transitions. Complement of second has 6 states. [2019-10-22 09:00:39,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 2 accepting loop states [2019-10-22 09:00:39,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2019-10-22 09:00:39,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 14 transitions. [2019-10-22 09:00:39,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 2 letters. [2019-10-22 09:00:39,188 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:39,188 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 11 letters. Loop has 2 letters. [2019-10-22 09:00:39,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:39,189 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 14 transitions. Stem has 9 letters. Loop has 4 letters. [2019-10-22 09:00:39,189 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-10-22 09:00:39,189 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 75 transitions. [2019-10-22 09:00:39,190 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:39,190 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 56 states and 69 transitions. [2019-10-22 09:00:39,190 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 5 [2019-10-22 09:00:39,190 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 5 [2019-10-22 09:00:39,190 INFO L73 IsDeterministic]: Start isDeterministic. Operand 56 states and 69 transitions. [2019-10-22 09:00:39,191 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-10-22 09:00:39,191 INFO L688 BuchiCegarLoop]: Abstraction has 56 states and 69 transitions. [2019-10-22 09:00:39,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states and 69 transitions. [2019-10-22 09:00:39,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-10-22 09:00:39,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-22 09:00:39,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2019-10-22 09:00:39,194 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-10-22 09:00:39,194 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 65 transitions. [2019-10-22 09:00:39,194 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-10-22 09:00:39,194 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 65 transitions. [2019-10-22 09:00:39,195 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2019-10-22 09:00:39,195 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-10-22 09:00:39,195 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-10-22 09:00:39,195 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 2, 2, 2, 2, 2, 1, 1, 1] [2019-10-22 09:00:39,195 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2019-10-22 09:00:39,195 INFO L791 eck$LassoCheckResult]: Stem: 1185#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1179#L-1 havoc main_#res;havoc main_#t~nondet18, main_#t~nondet19, main_#t~ret20;test_fun_#in~x, test_fun_#in~y := main_#t~nondet18, main_#t~nondet19;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem10, test_fun_#t~mem9, test_fun_#t~mem12, test_fun_#t~mem11, test_fun_#t~mem4, test_fun_#t~mem5, test_fun_#t~short6, test_fun_#t~mem13, test_fun_#t~mem14, test_fun_#t~short15, test_fun_#t~mem16, test_fun_#t~mem17, test_fun_~x, test_fun_~y, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.allocOnStack(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.allocOnStack(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1180#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1194#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1192#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1193#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1191#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1183#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1184#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1207#L559-1 assume !(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11; 1206#L559-4 call test_fun_#t~mem4 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem4 > 0; 1205#L553-1 assume test_fun_#t~short6;call test_fun_#t~mem5 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short6 := test_fun_#t~mem5 > 0; 1204#L553-3 assume !!test_fun_#t~short6;havoc test_fun_#t~mem5;havoc test_fun_#t~short6;havoc test_fun_#t~mem4;call test_fun_#t~mem7 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1203#L554 assume !(test_fun_#t~mem7 > test_fun_#t~mem8);havoc test_fun_#t~mem8;havoc test_fun_#t~mem7; 1202#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1201#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1199#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1181#L559-1 [2019-10-22 09:00:39,195 INFO L793 eck$LassoCheckResult]: Loop: 1181#L559-1 assume !!(test_fun_#t~mem11 > 0);havoc test_fun_#t~mem11;call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);havoc test_fun_#t~mem12; 1182#L559-3 call test_fun_#t~mem11 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); 1181#L559-1 [2019-10-22 09:00:39,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:39,196 INFO L82 PathProgramCache]: Analyzing trace with hash -2055714993, now seen corresponding path program 2 times [2019-10-22 09:00:39,196 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:39,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059445770] [2019-10-22 09:00:39,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,196 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:39,219 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-22 09:00:39,219 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059445770] [2019-10-22 09:00:39,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:39,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-22 09:00:39,220 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752412101] [2019-10-22 09:00:39,220 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-10-22 09:00:39,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:39,220 INFO L82 PathProgramCache]: Analyzing trace with hash 2428, now seen corresponding path program 2 times [2019-10-22 09:00:39,220 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:39,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379445460] [2019-10-22 09:00:39,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,220 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:39,221 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-10-22 09:00:39,225 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-10-22 09:00:39,247 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:39,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-22 09:00:39,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:39,247 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. cyclomatic complexity: 18 Second operand 5 states. [2019-10-22 09:00:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:39,280 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-10-22 09:00:39,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:39,280 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2019-10-22 09:00:39,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:39,281 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 0 states and 0 transitions. [2019-10-22 09:00:39,281 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-10-22 09:00:39,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-10-22 09:00:39,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-10-22 09:00:39,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-10-22 09:00:39,281 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:39,281 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:39,281 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:39,281 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-10-22 09:00:39,281 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:39,281 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-10-22 09:00:39,281 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-10-22 09:00:39,287 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 22.10 09:00:39 BoogieIcfgContainer [2019-10-22 09:00:39,287 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-10-22 09:00:39,288 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:39,288 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:39,288 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:39,288 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:18" (3/4) ... [2019-10-22 09:00:39,291 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-10-22 09:00:39,292 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:39,293 INFO L168 Benchmark]: Toolchain (without parser) took 21249.21 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 353.4 MB). Free memory was 943.2 MB in the beginning and 1.0 GB in the end (delta: -65.3 MB). Peak memory consumption was 288.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:39,293 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:39,294 INFO L168 Benchmark]: CACSL2BoogieTranslator took 550.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 943.2 MB in the beginning and 1.2 GB in the end (delta: -230.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:39,294 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:39,294 INFO L168 Benchmark]: Boogie Preprocessor took 23.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:39,295 INFO L168 Benchmark]: RCFGBuilder took 311.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:39,295 INFO L168 Benchmark]: BuchiAutomizer took 20309.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 131.6 MB). Peak memory consumption was 294.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:39,295 INFO L168 Benchmark]: Witness Printer took 4.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:39,297 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 967.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 550.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 190.3 MB). Free memory was 943.2 MB in the beginning and 1.2 GB in the end (delta: -230.7 MB). Peak memory consumption was 18.0 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 6.5 MB). Peak memory consumption was 6.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.52 ms. Allocated memory is still 1.2 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 311.81 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 27.2 MB). Peak memory consumption was 27.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 20309.99 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 163.1 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 131.6 MB). Peak memory consumption was 294.7 MB. Max. memory is 11.5 GB. * Witness Printer took 4.08 ms. Allocated memory is still 1.4 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (6 trivial, 4 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 6 locations. One deterministic module has affine ranking function (if aux-(*x_ref > 0) && (*y_ref > 0)-aux then 1 else 0) and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x_ref][x_ref] and consists of 4 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] and consists of 4 locations. 6 modules have a trivial ranking function, the largest among these consists of 10 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 20.2s and 11 iterations. TraceHistogramMax:4. Analysis of lassos took 6.9s. Construction of modules took 12.3s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 5. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 53 StatesRemovedByMinimization, 6 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 55 states and ocurred in iteration 6. Nontrivial modules had stage [4, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 8/8 HoareTripleCheckerStatistics: 117 SDtfs, 89 SDslu, 103 SDs, 0 SdLazy, 235 SolverSat, 37 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 12.3s Time LassoAnalysisResults: nont0 unkn0 SFLI4 SFLT0 conc0 concLT0 SILN0 SILU2 SILI0 SILT0 lasso4 LassoPreprocessingBenchmarks: Lassos: inital246 mio100 ax107 hnf99 lsp81 ukn75 mio100 lsp32 div100 bol103 ite100 ukn100 eq176 hnf89 smp96 dnf191 smp85 tf100 neg94 sie121 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 18ms VariablesStem: 5 VariablesLoop: 4 DisjunctsStem: 4 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 12 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...