./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/bitvector/byte_add-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/bitvector/byte_add-1.i -s /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 21:29:41,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 21:29:41,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 21:29:41,198 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 21:29:41,198 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 21:29:41,200 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 21:29:41,201 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 21:29:41,204 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 21:29:41,206 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 21:29:41,207 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 21:29:41,208 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 21:29:41,210 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 21:29:41,210 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 21:29:41,211 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 21:29:41,212 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 21:29:41,213 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 21:29:41,214 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 21:29:41,215 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 21:29:41,217 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 21:29:41,219 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 21:29:41,221 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 21:29:41,222 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 21:29:41,223 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 21:29:41,224 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 21:29:41,227 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 21:29:41,227 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 21:29:41,227 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 21:29:41,228 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 21:29:41,229 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 21:29:41,230 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 21:29:41,230 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 21:29:41,231 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 21:29:41,232 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 21:29:41,237 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 21:29:41,238 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 21:29:41,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 21:29:41,239 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 21:29:41,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 21:29:41,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 21:29:41,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 21:29:41,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 21:29:41,247 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 21:29:41,264 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 21:29:41,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 21:29:41,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 21:29:41,266 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 21:29:41,266 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 21:29:41,266 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 21:29:41,266 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 21:29:41,266 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 21:29:41,267 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 21:29:41,267 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 21:29:41,267 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 21:29:41,267 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 21:29:41,267 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 21:29:41,268 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 21:29:41,268 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 21:29:41,268 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 21:29:41,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 21:29:41,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 21:29:41,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 21:29:41,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 21:29:41,269 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 21:29:41,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 21:29:41,269 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 21:29:41,269 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 21:29:41,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 21:29:41,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 21:29:41,270 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 21:29:41,270 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 21:29:41,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 21:29:41,271 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 21:29:41,271 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 21:29:41,272 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 21:29:41,272 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a2c46755d0cb80f6b2e7b990e0a1bd9a49737b84 [2019-11-15 21:29:41,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 21:29:41,310 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 21:29:41,320 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 21:29:41,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 21:29:41,323 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 21:29:41,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/../../sv-benchmarks/c/bitvector/byte_add-1.i [2019-11-15 21:29:41,395 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/data/ae19293c7/05998cc8f06e4596b426375028c2fb7a/FLAG16b51f4cd [2019-11-15 21:29:41,854 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 21:29:41,855 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/sv-benchmarks/c/bitvector/byte_add-1.i [2019-11-15 21:29:41,863 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/data/ae19293c7/05998cc8f06e4596b426375028c2fb7a/FLAG16b51f4cd [2019-11-15 21:29:42,208 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/data/ae19293c7/05998cc8f06e4596b426375028c2fb7a [2019-11-15 21:29:42,211 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 21:29:42,212 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 21:29:42,213 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 21:29:42,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 21:29:42,217 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 21:29:42,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72956611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42, skipping insertion in model container [2019-11-15 21:29:42,221 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,229 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 21:29:42,251 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 21:29:42,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:29:42,548 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 21:29:42,581 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 21:29:42,595 INFO L192 MainTranslator]: Completed translation [2019-11-15 21:29:42,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42 WrapperNode [2019-11-15 21:29:42,595 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 21:29:42,596 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 21:29:42,597 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 21:29:42,597 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 21:29:42,606 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,614 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,642 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 21:29:42,642 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 21:29:42,642 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 21:29:42,642 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 21:29:42,652 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,652 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,654 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,655 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,660 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,668 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... [2019-11-15 21:29:42,671 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 21:29:42,671 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 21:29:42,671 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 21:29:42,671 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 21:29:42,672 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:29:42,735 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 21:29:42,736 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 21:29:43,102 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 21:29:43,102 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-11-15 21:29:43,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:29:43 BoogieIcfgContainer [2019-11-15 21:29:43,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 21:29:43,104 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 21:29:43,104 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 21:29:43,108 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 21:29:43,109 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:29:43,109 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 09:29:42" (1/3) ... [2019-11-15 21:29:43,112 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a23980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:29:43, skipping insertion in model container [2019-11-15 21:29:43,112 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:29:43,112 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 09:29:42" (2/3) ... [2019-11-15 21:29:43,113 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@54a23980 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 09:29:43, skipping insertion in model container [2019-11-15 21:29:43,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 21:29:43,113 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:29:43" (3/3) ... [2019-11-15 21:29:43,115 INFO L371 chiAutomizerObserver]: Analyzing ICFG byte_add-1.i [2019-11-15 21:29:43,179 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 21:29:43,179 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 21:29:43,179 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 21:29:43,179 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 21:29:43,180 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 21:29:43,180 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 21:29:43,180 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 21:29:43,180 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 21:29:43,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2019-11-15 21:29:43,219 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-11-15 21:29:43,219 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:43,219 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:43,226 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:29:43,226 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:43,226 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 21:29:43,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 40 states. [2019-11-15 21:29:43,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 23 [2019-11-15 21:29:43,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:43,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:43,231 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2019-11-15 21:29:43,231 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:43,237 INFO L791 eck$LassoCheckResult]: Stem: 35#ULTIMATE.startENTRYtrue havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10#L40true assume !(0 == mp_add_~a3~0 % 256); 8#L40-1true mp_add_~nb~0 := 4; 29#L50true assume !(0 == mp_add_~b3~0 % 256); 27#L50-1true mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 23#L61-2true [2019-11-15 21:29:43,238 INFO L793 eck$LassoCheckResult]: Loop: 23#L61-2true assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 36#L64true assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 33#L64-1true assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 25#L70true assume !(mp_add_~partial_sum~0 % 65536 > 254); 13#L76-1true assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3#L80-1true assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22#L81-1true assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7#L82-1true assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 31#L83-1true mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 23#L61-2true [2019-11-15 21:29:43,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,243 INFO L82 PathProgramCache]: Analyzing trace with hash 30109316, now seen corresponding path program 1 times [2019-11-15 21:29:43,250 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,250 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446067975] [2019-11-15 21:29:43,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,250 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,251 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:43,458 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:43,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,460 INFO L82 PathProgramCache]: Analyzing trace with hash -476987525, now seen corresponding path program 1 times [2019-11-15 21:29:43,460 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756158934] [2019-11-15 21:29:43,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:43,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:43,561 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756158934] [2019-11-15 21:29:43,562 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:43,562 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:43,563 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609149799] [2019-11-15 21:29:43,568 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:43,569 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:43,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:43,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:43,591 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 3 states. [2019-11-15 21:29:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:43,813 INFO L93 Difference]: Finished difference Result 63 states and 93 transitions. [2019-11-15 21:29:43,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:43,816 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 93 transitions. [2019-11-15 21:29:43,819 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 41 [2019-11-15 21:29:43,826 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 55 states and 85 transitions. [2019-11-15 21:29:43,828 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 55 [2019-11-15 21:29:43,830 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 55 [2019-11-15 21:29:43,831 INFO L73 IsDeterministic]: Start isDeterministic. Operand 55 states and 85 transitions. [2019-11-15 21:29:43,832 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:43,832 INFO L688 BuchiCegarLoop]: Abstraction has 55 states and 85 transitions. [2019-11-15 21:29:43,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states and 85 transitions. [2019-11-15 21:29:43,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2019-11-15 21:29:43,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 21:29:43,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 83 transitions. [2019-11-15 21:29:43,876 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2019-11-15 21:29:43,876 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 83 transitions. [2019-11-15 21:29:43,876 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 21:29:43,876 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 83 transitions. [2019-11-15 21:29:43,878 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 39 [2019-11-15 21:29:43,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:43,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:43,879 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:43,879 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:43,879 INFO L791 eck$LassoCheckResult]: Stem: 145#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 123#L40 assume !(0 == mp_add_~a3~0 % 256); 120#L40-1 mp_add_~nb~0 := 4; 121#L50 assume !(0 == mp_add_~b3~0 % 256); 131#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 138#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 139#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 136#L64-1 [2019-11-15 21:29:43,880 INFO L793 eck$LassoCheckResult]: Loop: 136#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 126#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 129#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 112#L80-1 assume !(1 == mp_add_~i~0 % 256); 113#L81-1 assume !(2 == mp_add_~i~0 % 256); 118#L82-1 assume !(3 == mp_add_~i~0 % 256); 119#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 143#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 159#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 160#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 127#L65-2 assume !(1 == mp_add_~i~0 % 256); 128#L66-1 assume !(2 == mp_add_~i~0 % 256); 135#L67-1 assume !(3 == mp_add_~i~0 % 256); 136#L64-1 [2019-11-15 21:29:43,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:43,880 INFO L82 PathProgramCache]: Analyzing trace with hash -1129716831, now seen corresponding path program 1 times [2019-11-15 21:29:43,880 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:43,880 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178102831] [2019-11-15 21:29:43,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,881 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:43,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:43,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:44,078 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178102831] [2019-11-15 21:29:44,079 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:44,079 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:29:44,079 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161169873] [2019-11-15 21:29:44,079 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:29:44,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:44,080 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 1 times [2019-11-15 21:29:44,080 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:44,080 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121836063] [2019-11-15 21:29:44,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,080 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:44,081 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:44,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:44,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:44,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121836063] [2019-11-15 21:29:44,209 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:44,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:29:44,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474167962] [2019-11-15 21:29:44,210 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:44,210 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:44,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:44,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:44,211 INFO L87 Difference]: Start difference. First operand 53 states and 83 transitions. cyclomatic complexity: 32 Second operand 6 states. [2019-11-15 21:29:45,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:45,202 INFO L93 Difference]: Finished difference Result 214 states and 320 transitions. [2019-11-15 21:29:45,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:29:45,204 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 214 states and 320 transitions. [2019-11-15 21:29:45,210 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 154 [2019-11-15 21:29:45,214 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 214 states to 214 states and 320 transitions. [2019-11-15 21:29:45,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 214 [2019-11-15 21:29:45,218 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 214 [2019-11-15 21:29:45,218 INFO L73 IsDeterministic]: Start isDeterministic. Operand 214 states and 320 transitions. [2019-11-15 21:29:45,220 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:45,221 INFO L688 BuchiCegarLoop]: Abstraction has 214 states and 320 transitions. [2019-11-15 21:29:45,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states and 320 transitions. [2019-11-15 21:29:45,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 128. [2019-11-15 21:29:45,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2019-11-15 21:29:45,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 181 transitions. [2019-11-15 21:29:45,239 INFO L711 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2019-11-15 21:29:45,239 INFO L591 BuchiCegarLoop]: Abstraction has 128 states and 181 transitions. [2019-11-15 21:29:45,239 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 21:29:45,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 128 states and 181 transitions. [2019-11-15 21:29:45,243 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 70 [2019-11-15 21:29:45,243 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:45,243 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:45,244 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:45,244 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:45,245 INFO L791 eck$LassoCheckResult]: Stem: 441#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 410#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 412#L42 assume !(0 == mp_add_~a2~0 % 256); 406#L40-1 mp_add_~nb~0 := 4; 407#L50 assume !(0 == mp_add_~b3~0 % 256); 433#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 434#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 485#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 488#L64-1 [2019-11-15 21:29:45,245 INFO L793 eck$LassoCheckResult]: Loop: 488#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 492#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 417#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 418#L80-1 assume !(1 == mp_add_~i~0 % 256); 428#L81-1 assume !(2 == mp_add_~i~0 % 256); 404#L82-1 assume !(3 == mp_add_~i~0 % 256); 405#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 438#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 448#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 443#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 415#L65-2 assume !(1 == mp_add_~i~0 % 256); 416#L66-1 assume !(2 == mp_add_~i~0 % 256); 444#L67-1 assume !(3 == mp_add_~i~0 % 256); 488#L64-1 [2019-11-15 21:29:45,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,246 INFO L82 PathProgramCache]: Analyzing trace with hash -360547704, now seen corresponding path program 1 times [2019-11-15 21:29:45,246 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,246 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474927424] [2019-11-15 21:29:45,246 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,247 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,248 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:45,470 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474927424] [2019-11-15 21:29:45,470 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:45,470 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:29:45,470 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570929930] [2019-11-15 21:29:45,471 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:29:45,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:45,471 INFO L82 PathProgramCache]: Analyzing trace with hash -792316473, now seen corresponding path program 2 times [2019-11-15 21:29:45,471 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:45,471 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661737139] [2019-11-15 21:29:45,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,472 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:45,472 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:45,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:45,549 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661737139] [2019-11-15 21:29:45,549 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:45,549 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:29:45,550 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724855127] [2019-11-15 21:29:45,550 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:45,550 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:45,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:29:45,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:29:45,551 INFO L87 Difference]: Start difference. First operand 128 states and 181 transitions. cyclomatic complexity: 56 Second operand 7 states. [2019-11-15 21:29:46,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:46,778 INFO L93 Difference]: Finished difference Result 375 states and 559 transitions. [2019-11-15 21:29:46,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:29:46,789 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 375 states and 559 transitions. [2019-11-15 21:29:46,796 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 303 [2019-11-15 21:29:46,802 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 375 states to 375 states and 559 transitions. [2019-11-15 21:29:46,802 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 375 [2019-11-15 21:29:46,803 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 375 [2019-11-15 21:29:46,804 INFO L73 IsDeterministic]: Start isDeterministic. Operand 375 states and 559 transitions. [2019-11-15 21:29:46,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:46,811 INFO L688 BuchiCegarLoop]: Abstraction has 375 states and 559 transitions. [2019-11-15 21:29:46,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states and 559 transitions. [2019-11-15 21:29:46,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 227. [2019-11-15 21:29:46,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-15 21:29:46,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 345 transitions. [2019-11-15 21:29:46,836 INFO L711 BuchiCegarLoop]: Abstraction has 227 states and 345 transitions. [2019-11-15 21:29:46,836 INFO L591 BuchiCegarLoop]: Abstraction has 227 states and 345 transitions. [2019-11-15 21:29:46,837 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 21:29:46,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states and 345 transitions. [2019-11-15 21:29:46,839 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 193 [2019-11-15 21:29:46,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:46,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:46,840 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:46,840 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:46,841 INFO L791 eck$LassoCheckResult]: Stem: 967#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 938#L40 assume !(0 == mp_add_~a3~0 % 256); 935#L40-1 mp_add_~nb~0 := 4; 936#L50 assume !(0 == mp_add_~b3~0 % 256); 960#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1077#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1076#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1075#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1017#L65-2 [2019-11-15 21:29:46,841 INFO L793 eck$LassoCheckResult]: Loop: 1017#L65-2 assume !(1 == mp_add_~i~0 % 256); 1074#L66-1 assume !(2 == mp_add_~i~0 % 256); 1073#L67-1 assume !(3 == mp_add_~i~0 % 256); 1072#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 1065#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 1049#L71-2 assume !(1 == mp_add_~i~0 % 256); 1063#L72-1 assume !(2 == mp_add_~i~0 % 256); 1060#L73-1 assume !(3 == mp_add_~i~0 % 256); 1056#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 1054#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 987#L80-1 assume !(1 == mp_add_~i~0 % 256); 982#L81-1 assume !(2 == mp_add_~i~0 % 256); 1045#L82-1 assume !(3 == mp_add_~i~0 % 256); 1035#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1029#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1018#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1016#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1017#L65-2 [2019-11-15 21:29:46,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:46,842 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 1 times [2019-11-15 21:29:46,842 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:46,842 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511690218] [2019-11-15 21:29:46,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:46,842 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:46,843 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:46,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:46,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:46,882 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:46,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:46,882 INFO L82 PathProgramCache]: Analyzing trace with hash -1792748981, now seen corresponding path program 1 times [2019-11-15 21:29:46,883 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:46,883 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738673778] [2019-11-15 21:29:46,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:46,883 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:46,901 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:46,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:46,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:46,968 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738673778] [2019-11-15 21:29:46,968 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:46,968 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:46,969 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946859110] [2019-11-15 21:29:46,969 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:46,969 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:46,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:29:46,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:29:46,970 INFO L87 Difference]: Start difference. First operand 227 states and 345 transitions. cyclomatic complexity: 125 Second operand 4 states. [2019-11-15 21:29:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:47,128 INFO L93 Difference]: Finished difference Result 347 states and 520 transitions. [2019-11-15 21:29:47,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:29:47,128 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 347 states and 520 transitions. [2019-11-15 21:29:47,132 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 313 [2019-11-15 21:29:47,137 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 347 states to 347 states and 520 transitions. [2019-11-15 21:29:47,137 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 347 [2019-11-15 21:29:47,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 347 [2019-11-15 21:29:47,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 347 states and 520 transitions. [2019-11-15 21:29:47,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:47,140 INFO L688 BuchiCegarLoop]: Abstraction has 347 states and 520 transitions. [2019-11-15 21:29:47,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states and 520 transitions. [2019-11-15 21:29:47,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 310. [2019-11-15 21:29:47,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 310 states. [2019-11-15 21:29:47,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 463 transitions. [2019-11-15 21:29:47,159 INFO L711 BuchiCegarLoop]: Abstraction has 310 states and 463 transitions. [2019-11-15 21:29:47,159 INFO L591 BuchiCegarLoop]: Abstraction has 310 states and 463 transitions. [2019-11-15 21:29:47,159 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 21:29:47,159 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 310 states and 463 transitions. [2019-11-15 21:29:47,173 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 276 [2019-11-15 21:29:47,174 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:47,174 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:47,175 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:47,175 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:47,175 INFO L791 eck$LassoCheckResult]: Stem: 1551#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 1519#L40 assume !(0 == mp_add_~a3~0 % 256); 1520#L40-1 mp_add_~nb~0 := 4; 1543#L50 assume !(0 == mp_add_~b3~0 % 256); 1544#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 1715#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1714#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1713#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1637#L65-2 [2019-11-15 21:29:47,176 INFO L793 eck$LassoCheckResult]: Loop: 1637#L65-2 assume !(1 == mp_add_~i~0 % 256); 1712#L66-1 assume !(2 == mp_add_~i~0 % 256); 1711#L67-1 assume !(3 == mp_add_~i~0 % 256); 1710#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 1709#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 1630#L71-2 assume !(1 == mp_add_~i~0 % 256); 1708#L72-1 assume !(2 == mp_add_~i~0 % 256); 1707#L73-1 assume !(3 == mp_add_~i~0 % 256); 1706#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 1705#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 1575#L80-1 assume !(1 == mp_add_~i~0 % 256); 1576#L81-1 assume !(2 == mp_add_~i~0 % 256); 1566#L82-1 assume !(3 == mp_add_~i~0 % 256); 1567#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1704#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1703#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1702#L65 assume !(0 == mp_add_~i~0 % 256); 1700#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 1698#L66-1 assume !(2 == mp_add_~i~0 % 256); 1692#L67-1 assume !(3 == mp_add_~i~0 % 256); 1690#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 1688#L71 assume !(0 == mp_add_~i~0 % 256); 1686#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 1682#L72-1 assume !(2 == mp_add_~i~0 % 256); 1681#L73-1 assume !(3 == mp_add_~i~0 % 256); 1679#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 1677#L76-1 assume !(0 == mp_add_~i~0 % 256); 1573#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 1574#L81-1 assume !(2 == mp_add_~i~0 % 256); 1644#L82-1 assume !(3 == mp_add_~i~0 % 256); 1640#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 1639#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 1638#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 1608#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 1637#L65-2 [2019-11-15 21:29:47,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 2 times [2019-11-15 21:29:47,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:47,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124659639] [2019-11-15 21:29:47,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,177 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:47,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:47,239 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:47,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:47,239 INFO L82 PathProgramCache]: Analyzing trace with hash 93473533, now seen corresponding path program 1 times [2019-11-15 21:29:47,240 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:47,240 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030758437] [2019-11-15 21:29:47,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,240 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,240 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:47,344 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:29:47,344 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030758437] [2019-11-15 21:29:47,344 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:47,344 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:47,345 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257526828] [2019-11-15 21:29:47,345 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:47,345 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:47,345 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:29:47,346 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:29:47,346 INFO L87 Difference]: Start difference. First operand 310 states and 463 transitions. cyclomatic complexity: 160 Second operand 4 states. [2019-11-15 21:29:47,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:47,558 INFO L93 Difference]: Finished difference Result 515 states and 750 transitions. [2019-11-15 21:29:47,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:29:47,561 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 515 states and 750 transitions. [2019-11-15 21:29:47,566 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 481 [2019-11-15 21:29:47,572 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 515 states to 515 states and 750 transitions. [2019-11-15 21:29:47,572 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 515 [2019-11-15 21:29:47,573 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 515 [2019-11-15 21:29:47,573 INFO L73 IsDeterministic]: Start isDeterministic. Operand 515 states and 750 transitions. [2019-11-15 21:29:47,574 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:47,574 INFO L688 BuchiCegarLoop]: Abstraction has 515 states and 750 transitions. [2019-11-15 21:29:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states and 750 transitions. [2019-11-15 21:29:47,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 345. [2019-11-15 21:29:47,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2019-11-15 21:29:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 515 transitions. [2019-11-15 21:29:47,587 INFO L711 BuchiCegarLoop]: Abstraction has 345 states and 515 transitions. [2019-11-15 21:29:47,587 INFO L591 BuchiCegarLoop]: Abstraction has 345 states and 515 transitions. [2019-11-15 21:29:47,587 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 21:29:47,588 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 345 states and 515 transitions. [2019-11-15 21:29:47,590 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 311 [2019-11-15 21:29:47,590 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:47,590 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:47,591 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:47,592 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:47,592 INFO L791 eck$LassoCheckResult]: Stem: 2384#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 2356#L40 assume !(0 == mp_add_~a3~0 % 256); 2357#L40-1 mp_add_~nb~0 := 4; 2380#L50 assume !(0 == mp_add_~b3~0 % 256); 2377#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 2373#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2374#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2365#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2359#L65-2 [2019-11-15 21:29:47,592 INFO L793 eck$LassoCheckResult]: Loop: 2359#L65-2 assume !(1 == mp_add_~i~0 % 256); 2360#L66-1 assume !(2 == mp_add_~i~0 % 256); 2670#L67-1 assume !(3 == mp_add_~i~0 % 256); 2668#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2669#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 2625#L71-2 assume !(1 == mp_add_~i~0 % 256); 2665#L72-1 assume !(2 == mp_add_~i~0 % 256); 2649#L73-1 assume !(3 == mp_add_~i~0 % 256); 2650#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 2615#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 2575#L80-1 assume !(1 == mp_add_~i~0 % 256); 2555#L81-1 assume !(2 == mp_add_~i~0 % 256); 2556#L82-1 assume !(3 == mp_add_~i~0 % 256); 2378#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2379#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2667#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2666#L65 assume !(0 == mp_add_~i~0 % 256); 2661#L65-2 assume !(1 == mp_add_~i~0 % 256); 2646#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 2644#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 2642#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 2640#L71 assume !(0 == mp_add_~i~0 % 256); 2637#L71-2 assume !(1 == mp_add_~i~0 % 256); 2635#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 2633#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 2629#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 2611#L76-1 assume !(0 == mp_add_~i~0 % 256); 2610#L80-1 assume !(1 == mp_add_~i~0 % 256); 2372#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 2349#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 2350#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 2397#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 2398#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 2608#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 2359#L65-2 [2019-11-15 21:29:47,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:47,593 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 3 times [2019-11-15 21:29:47,593 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:47,593 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786735119] [2019-11-15 21:29:47,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,594 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:47,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:47,617 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:47,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:47,618 INFO L82 PathProgramCache]: Analyzing trace with hash -1822879745, now seen corresponding path program 1 times [2019-11-15 21:29:47,618 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:47,618 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508604594] [2019-11-15 21:29:47,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,619 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,619 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:47,650 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:29:47,651 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508604594] [2019-11-15 21:29:47,651 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:47,651 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:47,651 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951387408] [2019-11-15 21:29:47,652 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:47,652 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:47,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:47,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:47,652 INFO L87 Difference]: Start difference. First operand 345 states and 515 transitions. cyclomatic complexity: 176 Second operand 3 states. [2019-11-15 21:29:47,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:47,747 INFO L93 Difference]: Finished difference Result 429 states and 613 transitions. [2019-11-15 21:29:47,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:47,747 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 429 states and 613 transitions. [2019-11-15 21:29:47,751 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 395 [2019-11-15 21:29:47,755 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 429 states to 429 states and 613 transitions. [2019-11-15 21:29:47,755 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 429 [2019-11-15 21:29:47,756 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 429 [2019-11-15 21:29:47,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 429 states and 613 transitions. [2019-11-15 21:29:47,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:47,757 INFO L688 BuchiCegarLoop]: Abstraction has 429 states and 613 transitions. [2019-11-15 21:29:47,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states and 613 transitions. [2019-11-15 21:29:47,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 389. [2019-11-15 21:29:47,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2019-11-15 21:29:47,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 566 transitions. [2019-11-15 21:29:47,767 INFO L711 BuchiCegarLoop]: Abstraction has 389 states and 566 transitions. [2019-11-15 21:29:47,767 INFO L591 BuchiCegarLoop]: Abstraction has 389 states and 566 transitions. [2019-11-15 21:29:47,767 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 21:29:47,768 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 389 states and 566 transitions. [2019-11-15 21:29:47,770 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 355 [2019-11-15 21:29:47,770 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:47,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:47,772 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:47,772 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:47,772 INFO L791 eck$LassoCheckResult]: Stem: 3164#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3136#L40 assume !(0 == mp_add_~a3~0 % 256); 3137#L40-1 mp_add_~nb~0 := 4; 3160#L50 assume !(0 == mp_add_~b3~0 % 256); 3159#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3154#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3155#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3145#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3146#L65-2 [2019-11-15 21:29:47,772 INFO L793 eck$LassoCheckResult]: Loop: 3146#L65-2 assume !(1 == mp_add_~i~0 % 256); 3495#L66-1 assume !(2 == mp_add_~i~0 % 256); 3494#L67-1 assume !(3 == mp_add_~i~0 % 256); 3493#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 3483#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 3463#L71-2 assume !(1 == mp_add_~i~0 % 256); 3479#L72-1 assume !(2 == mp_add_~i~0 % 256); 3475#L73-1 assume !(3 == mp_add_~i~0 % 256); 3471#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 3142#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 3123#L80-1 assume !(1 == mp_add_~i~0 % 256); 3124#L81-1 assume !(2 == mp_add_~i~0 % 256); 3464#L82-1 assume !(3 == mp_add_~i~0 % 256); 3462#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3459#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3457#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3456#L65 assume !(0 == mp_add_~i~0 % 256); 3453#L65-2 assume !(1 == mp_add_~i~0 % 256); 3450#L66-1 assume !(2 == mp_add_~i~0 % 256); 3447#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 3446#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 3444#L71 assume !(0 == mp_add_~i~0 % 256); 3441#L71-2 assume !(1 == mp_add_~i~0 % 256); 3438#L72-1 assume !(2 == mp_add_~i~0 % 256); 3436#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 3434#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 3378#L76-1 assume !(0 == mp_add_~i~0 % 256); 3379#L80-1 assume !(1 == mp_add_~i~0 % 256); 3371#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 3372#L82-1 assume !(3 == mp_add_~i~0 % 256); 3416#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3183#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3184#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3466#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3146#L65-2 [2019-11-15 21:29:47,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:47,773 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 4 times [2019-11-15 21:29:47,773 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:47,773 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861969627] [2019-11-15 21:29:47,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,774 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:47,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:47,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:47,797 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:47,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:47,797 INFO L82 PathProgramCache]: Analyzing trace with hash -2141036479, now seen corresponding path program 1 times [2019-11-15 21:29:47,798 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:47,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [470450330] [2019-11-15 21:29:47,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,798 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,798 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:47,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:47,828 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 21:29:47,829 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [470450330] [2019-11-15 21:29:47,829 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:47,829 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 21:29:47,829 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953104346] [2019-11-15 21:29:47,830 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:47,830 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:47,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 21:29:47,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 21:29:47,830 INFO L87 Difference]: Start difference. First operand 389 states and 566 transitions. cyclomatic complexity: 183 Second operand 3 states. [2019-11-15 21:29:47,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:47,957 INFO L93 Difference]: Finished difference Result 432 states and 628 transitions. [2019-11-15 21:29:47,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 21:29:47,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 432 states and 628 transitions. [2019-11-15 21:29:47,963 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 398 [2019-11-15 21:29:47,967 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 432 states to 432 states and 628 transitions. [2019-11-15 21:29:47,967 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 432 [2019-11-15 21:29:47,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 432 [2019-11-15 21:29:47,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 432 states and 628 transitions. [2019-11-15 21:29:47,971 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:47,971 INFO L688 BuchiCegarLoop]: Abstraction has 432 states and 628 transitions. [2019-11-15 21:29:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states and 628 transitions. [2019-11-15 21:29:47,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 424. [2019-11-15 21:29:47,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2019-11-15 21:29:47,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 620 transitions. [2019-11-15 21:29:47,983 INFO L711 BuchiCegarLoop]: Abstraction has 424 states and 620 transitions. [2019-11-15 21:29:47,983 INFO L591 BuchiCegarLoop]: Abstraction has 424 states and 620 transitions. [2019-11-15 21:29:47,983 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 21:29:47,983 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 424 states and 620 transitions. [2019-11-15 21:29:47,986 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 390 [2019-11-15 21:29:47,988 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:47,988 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:47,990 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:47,990 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:47,991 INFO L791 eck$LassoCheckResult]: Stem: 3994#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 3962#L40 assume !(0 == mp_add_~a3~0 % 256); 3963#L40-1 mp_add_~nb~0 := 4; 3988#L50 assume !(0 == mp_add_~b3~0 % 256); 3987#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 3982#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 3983#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 3973#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3967#L65-2 [2019-11-15 21:29:47,991 INFO L793 eck$LassoCheckResult]: Loop: 3967#L65-2 assume !(1 == mp_add_~i~0 % 256); 3968#L66-1 assume !(2 == mp_add_~i~0 % 256); 4368#L67-1 assume !(3 == mp_add_~i~0 % 256); 4367#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4353#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4322#L71-2 assume !(1 == mp_add_~i~0 % 256); 4352#L72-1 assume !(2 == mp_add_~i~0 % 256); 4351#L73-1 assume !(3 == mp_add_~i~0 % 256); 4350#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 4336#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4282#L80-1 assume !(1 == mp_add_~i~0 % 256); 4232#L81-1 assume !(2 == mp_add_~i~0 % 256); 4233#L82-1 assume !(3 == mp_add_~i~0 % 256); 3990#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 3991#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4346#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4344#L65 assume !(0 == mp_add_~i~0 % 256); 4342#L65-2 assume !(1 == mp_add_~i~0 % 256); 4340#L66-1 assume !(2 == mp_add_~i~0 % 256); 4338#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 4334#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4333#L71 assume !(0 == mp_add_~i~0 % 256); 4331#L71-2 assume !(1 == mp_add_~i~0 % 256); 4317#L72-1 assume !(2 == mp_add_~i~0 % 256); 4314#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 4312#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 3969#L76-1 assume !(0 == mp_add_~i~0 % 256); 3970#L80-1 assume !(1 == mp_add_~i~0 % 256); 4240#L81-1 assume !(2 == mp_add_~i~0 % 256); 4238#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 3957#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4010#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4011#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4274#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 3967#L65-2 [2019-11-15 21:29:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:47,992 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 5 times [2019-11-15 21:29:47,992 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:47,993 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117771766] [2019-11-15 21:29:47,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,993 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:47,993 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:48,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:48,038 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:48,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:48,039 INFO L82 PathProgramCache]: Analyzing trace with hash -2085625219, now seen corresponding path program 1 times [2019-11-15 21:29:48,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:48,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801244597] [2019-11-15 21:29:48,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:48,041 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:48,041 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:48,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:48,236 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:48,236 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801244597] [2019-11-15 21:29:48,236 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:48,237 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 21:29:48,237 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101854497] [2019-11-15 21:29:48,237 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:48,237 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:48,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:48,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:48,238 INFO L87 Difference]: Start difference. First operand 424 states and 620 transitions. cyclomatic complexity: 202 Second operand 5 states. [2019-11-15 21:29:48,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:48,511 INFO L93 Difference]: Finished difference Result 576 states and 788 transitions. [2019-11-15 21:29:48,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:29:48,511 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 576 states and 788 transitions. [2019-11-15 21:29:48,516 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 482 [2019-11-15 21:29:48,521 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 576 states to 576 states and 788 transitions. [2019-11-15 21:29:48,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 576 [2019-11-15 21:29:48,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 576 [2019-11-15 21:29:48,523 INFO L73 IsDeterministic]: Start isDeterministic. Operand 576 states and 788 transitions. [2019-11-15 21:29:48,524 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:48,524 INFO L688 BuchiCegarLoop]: Abstraction has 576 states and 788 transitions. [2019-11-15 21:29:48,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states and 788 transitions. [2019-11-15 21:29:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 433. [2019-11-15 21:29:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2019-11-15 21:29:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 625 transitions. [2019-11-15 21:29:48,535 INFO L711 BuchiCegarLoop]: Abstraction has 433 states and 625 transitions. [2019-11-15 21:29:48,536 INFO L591 BuchiCegarLoop]: Abstraction has 433 states and 625 transitions. [2019-11-15 21:29:48,536 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 21:29:48,536 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 433 states and 625 transitions. [2019-11-15 21:29:48,538 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 399 [2019-11-15 21:29:48,539 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:48,539 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:48,540 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:48,540 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:48,540 INFO L791 eck$LassoCheckResult]: Stem: 4998#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 4973#L40 assume !(0 == mp_add_~a3~0 % 256); 4974#L40-1 mp_add_~nb~0 := 4; 4993#L50 assume !(0 == mp_add_~b3~0 % 256); 4992#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 4989#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4990#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 4983#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4978#L65-2 [2019-11-15 21:29:48,540 INFO L793 eck$LassoCheckResult]: Loop: 4978#L65-2 assume !(1 == mp_add_~i~0 % 256); 4979#L66-1 assume !(2 == mp_add_~i~0 % 256); 4986#L67-1 assume !(3 == mp_add_~i~0 % 256); 4987#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 4996#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 4965#L71-2 assume !(1 == mp_add_~i~0 % 256); 4966#L72-1 assume !(2 == mp_add_~i~0 % 256); 4976#L73-1 assume !(3 == mp_add_~i~0 % 256); 4977#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 4980#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 4961#L80-1 assume !(1 == mp_add_~i~0 % 256); 4962#L81-1 assume !(2 == mp_add_~i~0 % 256); 4967#L82-1 assume !(3 == mp_add_~i~0 % 256); 4968#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 4995#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 4999#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5000#L65 assume !(0 == mp_add_~i~0 % 256); 5393#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 5001#L66-1 assume !(2 == mp_add_~i~0 % 256); 5002#L67-1 assume !(3 == mp_add_~i~0 % 256); 5387#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5385#L71 assume !(0 == mp_add_~i~0 % 256); 5384#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 5354#L72-1 assume !(2 == mp_add_~i~0 % 256); 5380#L73-1 assume !(3 == mp_add_~i~0 % 256); 5378#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 5375#L76-1 assume !(0 == mp_add_~i~0 % 256); 5361#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 5268#L81-1 assume !(2 == mp_add_~i~0 % 256); 5351#L82-1 assume !(3 == mp_add_~i~0 % 256); 5349#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5348#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5346#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5347#L65 assume !(0 == mp_add_~i~0 % 256); 5342#L65-2 assume !(1 == mp_add_~i~0 % 256); 5343#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 5338#L67-1 assume !(3 == mp_add_~i~0 % 256); 5337#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 5336#L71 assume !(0 == mp_add_~i~0 % 256); 5332#L71-2 assume !(1 == mp_add_~i~0 % 256); 5329#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 5245#L73-1 assume !(3 == mp_add_~i~0 % 256); 5244#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 5243#L76-1 assume !(0 == mp_add_~i~0 % 256); 5239#L80-1 assume !(1 == mp_add_~i~0 % 256); 5240#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 5266#L82-1 assume !(3 == mp_add_~i~0 % 256); 5027#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 5028#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 5241#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 5242#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 4978#L65-2 [2019-11-15 21:29:48,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:48,541 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 6 times [2019-11-15 21:29:48,541 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:48,541 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273258871] [2019-11-15 21:29:48,541 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:48,542 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:48,542 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:48,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:48,560 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:48,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:48,560 INFO L82 PathProgramCache]: Analyzing trace with hash 375371599, now seen corresponding path program 1 times [2019-11-15 21:29:48,561 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:48,561 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830569047] [2019-11-15 21:29:48,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:48,561 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:48,562 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:48,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:48,646 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 21:29:48,647 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830569047] [2019-11-15 21:29:48,647 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:29:48,647 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:29:48,647 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584366373] [2019-11-15 21:29:48,647 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:48,648 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:48,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:29:48,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-11-15 21:29:48,649 INFO L87 Difference]: Start difference. First operand 433 states and 625 transitions. cyclomatic complexity: 197 Second operand 5 states. [2019-11-15 21:29:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:49,008 INFO L93 Difference]: Finished difference Result 670 states and 949 transitions. [2019-11-15 21:29:49,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:29:49,008 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 670 states and 949 transitions. [2019-11-15 21:29:49,013 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 628 [2019-11-15 21:29:49,019 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 670 states to 662 states and 941 transitions. [2019-11-15 21:29:49,019 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2019-11-15 21:29:49,020 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 662 [2019-11-15 21:29:49,020 INFO L73 IsDeterministic]: Start isDeterministic. Operand 662 states and 941 transitions. [2019-11-15 21:29:49,022 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:49,022 INFO L688 BuchiCegarLoop]: Abstraction has 662 states and 941 transitions. [2019-11-15 21:29:49,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states and 941 transitions. [2019-11-15 21:29:49,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 449. [2019-11-15 21:29:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2019-11-15 21:29:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 653 transitions. [2019-11-15 21:29:49,034 INFO L711 BuchiCegarLoop]: Abstraction has 449 states and 653 transitions. [2019-11-15 21:29:49,034 INFO L591 BuchiCegarLoop]: Abstraction has 449 states and 653 transitions. [2019-11-15 21:29:49,034 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 21:29:49,034 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 449 states and 653 transitions. [2019-11-15 21:29:49,037 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 415 [2019-11-15 21:29:49,037 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:49,037 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:49,038 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:49,038 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:49,039 INFO L791 eck$LassoCheckResult]: Stem: 6118#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 6090#L40 assume !(0 == mp_add_~a3~0 % 256); 6091#L40-1 mp_add_~nb~0 := 4; 6114#L50 assume !(0 == mp_add_~b3~0 % 256); 6112#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 6113#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6518#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6517#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6504#L65-2 [2019-11-15 21:29:49,039 INFO L793 eck$LassoCheckResult]: Loop: 6504#L65-2 assume !(1 == mp_add_~i~0 % 256); 6516#L66-1 assume !(2 == mp_add_~i~0 % 256); 6515#L67-1 assume !(3 == mp_add_~i~0 % 256); 6514#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6495#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 6491#L71-2 assume !(1 == mp_add_~i~0 % 256); 6492#L72-1 assume !(2 == mp_add_~i~0 % 256); 6489#L73-1 assume !(3 == mp_add_~i~0 % 256); 6487#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6476#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 6078#L80-1 assume !(1 == mp_add_~i~0 % 256); 6079#L81-1 assume !(2 == mp_add_~i~0 % 256); 6526#L82-1 assume !(3 == mp_add_~i~0 % 256); 6116#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6109#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6110#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6101#L65 assume !(0 == mp_add_~i~0 % 256); 6095#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 6096#L66-1 assume !(2 == mp_add_~i~0 % 256); 6119#L67-1 assume !(3 == mp_add_~i~0 % 256); 6522#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6520#L71 assume !(0 == mp_add_~i~0 % 256); 6082#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 6083#L72-1 assume !(2 == mp_add_~i~0 % 256); 6093#L73-1 assume !(3 == mp_add_~i~0 % 256); 6094#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6097#L76-1 assume !(0 == mp_add_~i~0 % 256); 6098#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 6108#L81-1 assume !(2 == mp_add_~i~0 % 256); 6084#L82-1 assume !(3 == mp_add_~i~0 % 256); 6085#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6525#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6524#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6425#L65 assume !(0 == mp_add_~i~0 % 256); 6523#L65-2 assume !(1 == mp_add_~i~0 % 256); 6521#L66-1 assume !(2 == mp_add_~i~0 % 256); 6104#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 6105#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 6088#L71 assume !(0 == mp_add_~i~0 % 256); 6089#L71-2 assume !(1 == mp_add_~i~0 % 256); 6509#L72-1 assume !(2 == mp_add_~i~0 % 256); 6508#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 6507#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 6369#L76-1 assume !(0 == mp_add_~i~0 % 256); 6364#L80-1 assume !(1 == mp_add_~i~0 % 256); 6365#L81-1 assume !(2 == mp_add_~i~0 % 256); 6390#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 6389#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 6128#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 6129#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 6503#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 6504#L65-2 [2019-11-15 21:29:49,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:49,039 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 7 times [2019-11-15 21:29:49,040 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:49,040 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282195140] [2019-11-15 21:29:49,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:49,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:49,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:49,071 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:49,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:49,074 INFO L82 PathProgramCache]: Analyzing trace with hash 1783669771, now seen corresponding path program 1 times [2019-11-15 21:29:49,074 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:49,076 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091002964] [2019-11-15 21:29:49,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:49,078 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:49,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:49,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 49 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:29:49,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091002964] [2019-11-15 21:29:49,280 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427865991] [2019-11-15 21:29:49,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:49,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:49,333 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 21:29:49,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:49,428 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:29:49,428 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:49,428 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4] total 8 [2019-11-15 21:29:49,428 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212619835] [2019-11-15 21:29:49,429 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:49,429 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:49,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:29:49,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:29:49,430 INFO L87 Difference]: Start difference. First operand 449 states and 653 transitions. cyclomatic complexity: 209 Second operand 8 states. [2019-11-15 21:29:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:49,974 INFO L93 Difference]: Finished difference Result 662 states and 881 transitions. [2019-11-15 21:29:49,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 21:29:49,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 662 states and 881 transitions. [2019-11-15 21:29:49,981 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 568 [2019-11-15 21:29:49,986 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 662 states to 662 states and 881 transitions. [2019-11-15 21:29:49,986 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 662 [2019-11-15 21:29:49,987 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 662 [2019-11-15 21:29:49,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 662 states and 881 transitions. [2019-11-15 21:29:49,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:49,989 INFO L688 BuchiCegarLoop]: Abstraction has 662 states and 881 transitions. [2019-11-15 21:29:49,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states and 881 transitions. [2019-11-15 21:29:50,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 435. [2019-11-15 21:29:50,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2019-11-15 21:29:50,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 620 transitions. [2019-11-15 21:29:50,005 INFO L711 BuchiCegarLoop]: Abstraction has 435 states and 620 transitions. [2019-11-15 21:29:50,006 INFO L591 BuchiCegarLoop]: Abstraction has 435 states and 620 transitions. [2019-11-15 21:29:50,006 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 21:29:50,006 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 435 states and 620 transitions. [2019-11-15 21:29:50,009 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 401 [2019-11-15 21:29:50,009 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:50,009 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:50,010 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:50,010 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:50,011 INFO L791 eck$LassoCheckResult]: Stem: 7396#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 7369#L40 assume !(0 == mp_add_~a3~0 % 256); 7370#L40-1 mp_add_~nb~0 := 4; 7391#L50 assume !(0 == mp_add_~b3~0 % 256); 7387#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 7388#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7394#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7395#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7738#L65-2 [2019-11-15 21:29:50,012 INFO L793 eck$LassoCheckResult]: Loop: 7738#L65-2 assume !(1 == mp_add_~i~0 % 256); 7790#L66-1 assume !(2 == mp_add_~i~0 % 256); 7789#L67-1 assume !(3 == mp_add_~i~0 % 256); 7788#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7787#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 7720#L71-2 assume !(1 == mp_add_~i~0 % 256); 7389#L72-1 assume !(2 == mp_add_~i~0 % 256); 7390#L73-1 assume !(3 == mp_add_~i~0 % 256); 7386#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 7374#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 7356#L80-1 assume !(1 == mp_add_~i~0 % 256); 7357#L81-1 assume !(2 == mp_add_~i~0 % 256); 7362#L82-1 assume !(3 == mp_add_~i~0 % 256); 7363#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7383#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7384#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7377#L65 assume !(0 == mp_add_~i~0 % 256); 7372#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 7373#L66-1 assume !(2 == mp_add_~i~0 % 256); 7380#L67-1 assume !(3 == mp_add_~i~0 % 256); 7381#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7364#L71 assume !(0 == mp_add_~i~0 % 256); 7360#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 7361#L72-1 assume !(2 == mp_add_~i~0 % 256); 7747#L73-1 assume !(3 == mp_add_~i~0 % 256); 7745#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 7741#L76-1 assume !(0 == mp_add_~i~0 % 256); 7739#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 7646#L81-1 assume !(2 == mp_add_~i~0 % 256); 7737#L82-1 assume !(3 == mp_add_~i~0 % 256); 7735#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7734#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7733#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7732#L65 assume !(0 == mp_add_~i~0 % 256); 7731#L65-2 assume !(1 == mp_add_~i~0 % 256); 7726#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 7724#L67-1 assume !(3 == mp_add_~i~0 % 256); 7722#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 7721#L71 assume !(0 == mp_add_~i~0 % 256); 7704#L71-2 assume !(1 == mp_add_~i~0 % 256); 7700#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 7696#L73-1 assume !(3 == mp_add_~i~0 % 256); 7691#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 7690#L76-1 assume !(0 == mp_add_~i~0 % 256); 7649#L80-1 assume !(1 == mp_add_~i~0 % 256); 7650#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 7638#L82-1 assume !(3 == mp_add_~i~0 % 256); 7639#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7419#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7420#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 7773#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 7768#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 7674#L76-1 assume !(0 == mp_add_~i~0 % 256); 7673#L80-1 assume !(1 == mp_add_~i~0 % 256); 7672#L81-1 assume !(2 == mp_add_~i~0 % 256); 7443#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 7444#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 7407#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 7408#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 7689#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 7738#L65-2 [2019-11-15 21:29:50,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:50,013 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 8 times [2019-11-15 21:29:50,013 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:50,013 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520951970] [2019-11-15 21:29:50,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:50,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:50,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:50,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:50,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:50,038 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:50,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1325689095, now seen corresponding path program 1 times [2019-11-15 21:29:50,038 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:50,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612902712] [2019-11-15 21:29:50,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:50,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:50,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 61 proven. 2 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:29:50,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612902712] [2019-11-15 21:29:50,148 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1808411147] [2019-11-15 21:29:50,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:50,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:50,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:29:50,206 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:50,227 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:29:50,275 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 57 proven. 4 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:29:50,276 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:29:50,276 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-11-15 21:29:50,276 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284604815] [2019-11-15 21:29:50,278 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:50,278 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:50,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-15 21:29:50,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-15 21:29:50,279 INFO L87 Difference]: Start difference. First operand 435 states and 620 transitions. cyclomatic complexity: 190 Second operand 6 states. [2019-11-15 21:29:50,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:29:50,529 INFO L93 Difference]: Finished difference Result 859 states and 1141 transitions. [2019-11-15 21:29:50,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-15 21:29:50,530 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 859 states and 1141 transitions. [2019-11-15 21:29:50,536 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 824 [2019-11-15 21:29:50,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 859 states to 859 states and 1141 transitions. [2019-11-15 21:29:50,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 859 [2019-11-15 21:29:50,546 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 859 [2019-11-15 21:29:50,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 859 states and 1141 transitions. [2019-11-15 21:29:50,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:29:50,548 INFO L688 BuchiCegarLoop]: Abstraction has 859 states and 1141 transitions. [2019-11-15 21:29:50,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 859 states and 1141 transitions. [2019-11-15 21:29:50,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 859 to 549. [2019-11-15 21:29:50,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 549 states. [2019-11-15 21:29:50,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 782 transitions. [2019-11-15 21:29:50,566 INFO L711 BuchiCegarLoop]: Abstraction has 549 states and 782 transitions. [2019-11-15 21:29:50,567 INFO L591 BuchiCegarLoop]: Abstraction has 549 states and 782 transitions. [2019-11-15 21:29:50,568 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 21:29:50,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 549 states and 782 transitions. [2019-11-15 21:29:50,571 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 514 [2019-11-15 21:29:50,571 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:29:50,571 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:29:50,572 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:50,572 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:29:50,572 INFO L791 eck$LassoCheckResult]: Stem: 8889#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 8856#L40 assume !(0 == mp_add_~a3~0 % 256); 8857#L40-1 mp_add_~nb~0 := 4; 8881#L50 assume !(0 == mp_add_~b3~0 % 256); 8878#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 8879#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9093#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9094#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9072#L65-2 [2019-11-15 21:29:50,573 INFO L793 eck$LassoCheckResult]: Loop: 9072#L65-2 assume !(1 == mp_add_~i~0 % 256); 9073#L66-1 assume !(2 == mp_add_~i~0 % 256); 8868#L67-1 assume !(3 == mp_add_~i~0 % 256); 8869#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 8850#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 8851#L71-2 assume !(1 == mp_add_~i~0 % 256); 9387#L72-1 assume !(2 == mp_add_~i~0 % 256); 9386#L73-1 assume !(3 == mp_add_~i~0 % 256); 9385#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 9378#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 9377#L80-1 assume !(1 == mp_add_~i~0 % 256); 9364#L81-1 assume !(2 == mp_add_~i~0 % 256); 9340#L82-1 assume !(3 == mp_add_~i~0 % 256); 9336#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9087#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9088#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9079#L65 assume !(0 == mp_add_~i~0 % 256); 9080#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 9261#L66-1 assume !(2 == mp_add_~i~0 % 256); 9335#L67-1 assume !(3 == mp_add_~i~0 % 256); 9334#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9333#L71 assume !(0 == mp_add_~i~0 % 256); 9332#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 9315#L72-1 assume !(2 == mp_add_~i~0 % 256); 9331#L73-1 assume !(3 == mp_add_~i~0 % 256); 9330#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 9329#L76-1 assume !(0 == mp_add_~i~0 % 256); 9328#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 9236#L81-1 assume !(2 == mp_add_~i~0 % 256); 9277#L82-1 assume !(3 == mp_add_~i~0 % 256); 9274#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9273#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9257#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 9075#L65 assume !(0 == mp_add_~i~0 % 256); 9076#L65-2 assume !(1 == mp_add_~i~0 % 256); 9066#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 9067#L67-1 assume !(3 == mp_add_~i~0 % 256); 9327#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 9326#L71 assume !(0 == mp_add_~i~0 % 256); 9325#L71-2 assume !(1 == mp_add_~i~0 % 256); 9258#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 9259#L73-1 assume !(3 == mp_add_~i~0 % 256); 9247#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 9249#L76-1 assume !(0 == mp_add_~i~0 % 256); 9376#L80-1 assume !(1 == mp_add_~i~0 % 256); 9100#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 9101#L82-1 assume !(3 == mp_add_~i~0 % 256); 9276#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9267#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 9084#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 9086#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 9365#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 9283#L76-1 assume !(0 == mp_add_~i~0 % 256); 9235#L80-1 assume !(1 == mp_add_~i~0 % 256); 9237#L81-1 assume !(2 == mp_add_~i~0 % 256); 9372#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 9371#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 9370#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 8886#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 8887#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 9072#L65-2 [2019-11-15 21:29:50,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:50,573 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 9 times [2019-11-15 21:29:50,573 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:50,573 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135795522] [2019-11-15 21:29:50,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:50,574 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:50,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:50,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:29:50,601 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:29:50,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:29:50,602 INFO L82 PathProgramCache]: Analyzing trace with hash 668455611, now seen corresponding path program 1 times [2019-11-15 21:29:50,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:29:50,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006973764] [2019-11-15 21:29:50,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:50,603 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:29:50,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:29:50,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 11 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:29:50,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006973764] [2019-11-15 21:29:50,741 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750291842] [2019-11-15 21:29:50,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:29:50,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:29:50,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-15 21:29:50,803 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:29:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-11-15 21:29:50,871 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:29:50,871 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-11-15 21:29:50,871 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002737464] [2019-11-15 21:29:50,873 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:29:50,874 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:29:50,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:29:50,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:29:50,875 INFO L87 Difference]: Start difference. First operand 549 states and 782 transitions. cyclomatic complexity: 238 Second operand 4 states. [2019-11-15 21:30:03,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:03,596 INFO L93 Difference]: Finished difference Result 791 states and 1067 transitions. [2019-11-15 21:30:03,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:30:03,597 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 791 states and 1067 transitions. [2019-11-15 21:30:03,604 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 754 [2019-11-15 21:30:03,610 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 791 states to 789 states and 1057 transitions. [2019-11-15 21:30:03,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 789 [2019-11-15 21:30:03,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 789 [2019-11-15 21:30:03,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 789 states and 1057 transitions. [2019-11-15 21:30:03,613 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:03,613 INFO L688 BuchiCegarLoop]: Abstraction has 789 states and 1057 transitions. [2019-11-15 21:30:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states and 1057 transitions. [2019-11-15 21:30:03,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 696. [2019-11-15 21:30:03,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-15 21:30:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 950 transitions. [2019-11-15 21:30:03,628 INFO L711 BuchiCegarLoop]: Abstraction has 696 states and 950 transitions. [2019-11-15 21:30:03,628 INFO L591 BuchiCegarLoop]: Abstraction has 696 states and 950 transitions. [2019-11-15 21:30:03,628 INFO L424 BuchiCegarLoop]: ======== Iteration 13============ [2019-11-15 21:30:03,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 696 states and 950 transitions. [2019-11-15 21:30:03,632 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 661 [2019-11-15 21:30:03,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:03,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:03,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:03,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:03,633 INFO L791 eck$LassoCheckResult]: Stem: 10414#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 10383#L40 assume !(0 == mp_add_~a3~0 % 256); 10384#L40-1 mp_add_~nb~0 := 4; 10408#L50 assume !(0 == mp_add_~b3~0 % 256); 10409#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 11010#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11009#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11008#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10913#L65-2 [2019-11-15 21:30:03,635 INFO L793 eck$LassoCheckResult]: Loop: 10913#L65-2 assume !(1 == mp_add_~i~0 % 256); 11007#L66-1 assume !(2 == mp_add_~i~0 % 256); 11006#L67-1 assume !(3 == mp_add_~i~0 % 256); 11005#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11004#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 10900#L71-2 assume !(1 == mp_add_~i~0 % 256); 11003#L72-1 assume !(2 == mp_add_~i~0 % 256); 11002#L73-1 assume !(3 == mp_add_~i~0 % 256); 11001#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 10991#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 10810#L80-1 assume !(1 == mp_add_~i~0 % 256); 10806#L81-1 assume !(2 == mp_add_~i~0 % 256); 10807#L82-1 assume !(3 == mp_add_~i~0 % 256); 11023#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 11022#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 11021#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 11020#L65 assume !(0 == mp_add_~i~0 % 256); 11019#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 10911#L66-1 assume !(2 == mp_add_~i~0 % 256); 11018#L67-1 assume !(3 == mp_add_~i~0 % 256); 11017#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 11016#L71 assume !(0 == mp_add_~i~0 % 256); 11015#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 10898#L72-1 assume !(2 == mp_add_~i~0 % 256); 11014#L73-1 assume !(3 == mp_add_~i~0 % 256); 11013#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 11011#L76-1 assume !(0 == mp_add_~i~0 % 256); 10933#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 10834#L81-1 assume !(2 == mp_add_~i~0 % 256); 10932#L82-1 assume !(3 == mp_add_~i~0 % 256); 10931#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10930#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10928#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10927#L65 assume !(0 == mp_add_~i~0 % 256); 10926#L65-2 assume !(1 == mp_add_~i~0 % 256); 10925#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 10909#L67-1 assume !(3 == mp_add_~i~0 % 256); 10921#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 10919#L71 assume !(0 == mp_add_~i~0 % 256); 10916#L71-2 assume !(1 == mp_add_~i~0 % 256); 10879#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 10878#L73-1 assume !(3 == mp_add_~i~0 % 256); 10877#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 10876#L76-1 assume !(0 == mp_add_~i~0 % 256); 10875#L80-1 assume !(1 == mp_add_~i~0 % 256); 10869#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 10868#L82-1 assume !(3 == mp_add_~i~0 % 256); 10867#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10866#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10824#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 10826#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 10818#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 10819#L76-1 assume !(0 == mp_add_~i~0 % 256); 10841#L80-1 assume !(1 == mp_add_~i~0 % 256); 10832#L81-1 assume !(2 == mp_add_~i~0 % 256); 10805#L82-1 assume !(3 == mp_add_~i~0 % 256); 10636#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 10907#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 10904#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 10854#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 10913#L65-2 [2019-11-15 21:30:03,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:03,635 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 10 times [2019-11-15 21:30:03,635 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:03,635 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194343801] [2019-11-15 21:30:03,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:03,636 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:03,636 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:03,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:03,663 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:03,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:03,667 INFO L82 PathProgramCache]: Analyzing trace with hash 670302653, now seen corresponding path program 1 times [2019-11-15 21:30:03,667 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:03,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245267149] [2019-11-15 21:30:03,667 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:03,668 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:03,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:03,899 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 22 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:30:03,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245267149] [2019-11-15 21:30:03,899 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539820504] [2019-11-15 21:30:03,900 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:30:03,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:03,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:30:03,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:30:04,124 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 51 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 21:30:04,125 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:30:04,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-11-15 21:30:04,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774919843] [2019-11-15 21:30:04,126 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:04,126 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:04,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-15 21:30:04,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:30:04,127 INFO L87 Difference]: Start difference. First operand 696 states and 950 transitions. cyclomatic complexity: 259 Second operand 12 states. [2019-11-15 21:30:05,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:05,316 INFO L93 Difference]: Finished difference Result 1024 states and 1295 transitions. [2019-11-15 21:30:05,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:30:05,318 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1024 states and 1295 transitions. [2019-11-15 21:30:05,325 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 943 [2019-11-15 21:30:05,333 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1024 states to 976 states and 1210 transitions. [2019-11-15 21:30:05,333 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 976 [2019-11-15 21:30:05,334 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 976 [2019-11-15 21:30:05,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 976 states and 1210 transitions. [2019-11-15 21:30:05,336 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:05,336 INFO L688 BuchiCegarLoop]: Abstraction has 976 states and 1210 transitions. [2019-11-15 21:30:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states and 1210 transitions. [2019-11-15 21:30:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 607. [2019-11-15 21:30:05,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2019-11-15 21:30:05,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 792 transitions. [2019-11-15 21:30:05,353 INFO L711 BuchiCegarLoop]: Abstraction has 607 states and 792 transitions. [2019-11-15 21:30:05,353 INFO L591 BuchiCegarLoop]: Abstraction has 607 states and 792 transitions. [2019-11-15 21:30:05,354 INFO L424 BuchiCegarLoop]: ======== Iteration 14============ [2019-11-15 21:30:05,354 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 607 states and 792 transitions. [2019-11-15 21:30:05,357 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 574 [2019-11-15 21:30:05,357 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:05,358 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:05,358 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:05,359 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:05,359 INFO L791 eck$LassoCheckResult]: Stem: 12318#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 12291#L40 assume !(0 == mp_add_~a3~0 % 256); 12288#L40-1 mp_add_~nb~0 := 4; 12289#L50 assume !(0 == mp_add_~b3~0 % 256); 12679#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 12678#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12677#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12676#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12612#L65-2 [2019-11-15 21:30:05,359 INFO L793 eck$LassoCheckResult]: Loop: 12612#L65-2 assume !(1 == mp_add_~i~0 % 256); 12675#L66-1 assume !(2 == mp_add_~i~0 % 256); 12674#L67-1 assume !(3 == mp_add_~i~0 % 256); 12673#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12672#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 12598#L71-2 assume !(1 == mp_add_~i~0 % 256); 12671#L72-1 assume !(2 == mp_add_~i~0 % 256); 12670#L73-1 assume !(3 == mp_add_~i~0 % 256); 12669#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 12668#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 12563#L80-1 assume !(1 == mp_add_~i~0 % 256); 12667#L81-1 assume !(2 == mp_add_~i~0 % 256); 12666#L82-1 assume !(3 == mp_add_~i~0 % 256); 12665#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12664#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12663#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12662#L65 assume !(0 == mp_add_~i~0 % 256); 12661#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 12610#L66-1 assume !(2 == mp_add_~i~0 % 256); 12660#L67-1 assume !(3 == mp_add_~i~0 % 256); 12659#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12658#L71 assume !(0 == mp_add_~i~0 % 256); 12657#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 12595#L72-1 assume !(2 == mp_add_~i~0 % 256); 12656#L73-1 assume !(3 == mp_add_~i~0 % 256); 12655#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 12654#L76-1 assume !(0 == mp_add_~i~0 % 256); 12653#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 12560#L81-1 assume !(2 == mp_add_~i~0 % 256); 12652#L82-1 assume !(3 == mp_add_~i~0 % 256); 12651#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12650#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12649#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12648#L65 assume !(0 == mp_add_~i~0 % 256); 12647#L65-2 assume !(1 == mp_add_~i~0 % 256); 12646#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 12607#L67-1 assume !(3 == mp_add_~i~0 % 256); 12645#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 12644#L71 assume !(0 == mp_add_~i~0 % 256); 12643#L71-2 assume !(1 == mp_add_~i~0 % 256); 12642#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 12641#L73-1 assume !(3 == mp_add_~i~0 % 256); 12639#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12638#L76-1 assume !(0 == mp_add_~i~0 % 256); 12637#L80-1 assume !(1 == mp_add_~i~0 % 256); 12635#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 12634#L82-1 assume !(3 == mp_add_~i~0 % 256); 12633#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12632#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12630#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12628#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12569#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12625#L76-1 assume !(0 == mp_add_~i~0 % 256); 12623#L80-1 assume !(1 == mp_add_~i~0 % 256); 12621#L81-1 assume !(2 == mp_add_~i~0 % 256); 12555#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 12546#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12545#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12530#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 12532#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 12581#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 12580#L76-1 assume !(0 == mp_add_~i~0 % 256); 12579#L80-1 assume !(1 == mp_add_~i~0 % 256); 12578#L81-1 assume !(2 == mp_add_~i~0 % 256); 12577#L82-1 assume !(3 == mp_add_~i~0 % 256); 12557#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 12576#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 12574#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 12575#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 12612#L65-2 [2019-11-15 21:30:05,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:05,360 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 11 times [2019-11-15 21:30:05,360 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:05,360 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23670162] [2019-11-15 21:30:05,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:05,360 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:05,361 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:05,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:05,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:05,378 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:05,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:05,378 INFO L82 PathProgramCache]: Analyzing trace with hash -488824369, now seen corresponding path program 2 times [2019-11-15 21:30:05,379 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:05,379 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58926251] [2019-11-15 21:30:05,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:05,379 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:05,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:05,454 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-11-15 21:30:05,454 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58926251] [2019-11-15 21:30:05,454 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:30:05,455 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 21:30:05,455 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324712308] [2019-11-15 21:30:05,455 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:05,455 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:05,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 21:30:05,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 21:30:05,456 INFO L87 Difference]: Start difference. First operand 607 states and 792 transitions. cyclomatic complexity: 189 Second operand 4 states. [2019-11-15 21:30:05,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:05,550 INFO L93 Difference]: Finished difference Result 914 states and 1147 transitions. [2019-11-15 21:30:05,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 21:30:05,550 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 914 states and 1147 transitions. [2019-11-15 21:30:05,556 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 881 [2019-11-15 21:30:05,563 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 914 states to 914 states and 1147 transitions. [2019-11-15 21:30:05,563 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 914 [2019-11-15 21:30:05,565 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 914 [2019-11-15 21:30:05,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 914 states and 1147 transitions. [2019-11-15 21:30:05,567 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:05,567 INFO L688 BuchiCegarLoop]: Abstraction has 914 states and 1147 transitions. [2019-11-15 21:30:05,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 914 states and 1147 transitions. [2019-11-15 21:30:05,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 914 to 701. [2019-11-15 21:30:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 701 states. [2019-11-15 21:30:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 701 states to 701 states and 920 transitions. [2019-11-15 21:30:05,585 INFO L711 BuchiCegarLoop]: Abstraction has 701 states and 920 transitions. [2019-11-15 21:30:05,585 INFO L591 BuchiCegarLoop]: Abstraction has 701 states and 920 transitions. [2019-11-15 21:30:05,585 INFO L424 BuchiCegarLoop]: ======== Iteration 15============ [2019-11-15 21:30:05,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 701 states and 920 transitions. [2019-11-15 21:30:05,589 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 668 [2019-11-15 21:30:05,589 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:05,589 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:05,591 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:05,591 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:05,591 INFO L791 eck$LassoCheckResult]: Stem: 13847#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 13820#L40 assume !(0 == mp_add_~a3~0 % 256); 13816#L40-1 mp_add_~nb~0 := 4; 13817#L50 assume !(0 == mp_add_~b3~0 % 256); 14278#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 14277#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14276#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14275#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 14188#L65-2 [2019-11-15 21:30:05,591 INFO L793 eck$LassoCheckResult]: Loop: 14188#L65-2 assume !(1 == mp_add_~i~0 % 256); 14274#L66-1 assume !(2 == mp_add_~i~0 % 256); 14273#L67-1 assume !(3 == mp_add_~i~0 % 256); 14272#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14271#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 14155#L71-2 assume !(1 == mp_add_~i~0 % 256); 14270#L72-1 assume !(2 == mp_add_~i~0 % 256); 14269#L73-1 assume !(3 == mp_add_~i~0 % 256); 14268#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 14267#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 14131#L80-1 assume !(1 == mp_add_~i~0 % 256); 14266#L81-1 assume !(2 == mp_add_~i~0 % 256); 14265#L82-1 assume !(3 == mp_add_~i~0 % 256); 14264#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14263#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14262#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14261#L65 assume !(0 == mp_add_~i~0 % 256); 14260#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 14187#L66-1 assume !(2 == mp_add_~i~0 % 256); 14259#L67-1 assume !(3 == mp_add_~i~0 % 256); 14258#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14257#L71 assume !(0 == mp_add_~i~0 % 256); 14256#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 14151#L72-1 assume !(2 == mp_add_~i~0 % 256); 14255#L73-1 assume !(3 == mp_add_~i~0 % 256); 14254#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 14253#L76-1 assume !(0 == mp_add_~i~0 % 256); 14252#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 14128#L81-1 assume !(2 == mp_add_~i~0 % 256); 14251#L82-1 assume !(3 == mp_add_~i~0 % 256); 14250#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14244#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14240#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14221#L65 assume !(0 == mp_add_~i~0 % 256); 14219#L65-2 assume !(1 == mp_add_~i~0 % 256); 14216#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 14184#L67-1 assume !(3 == mp_add_~i~0 % 256); 14215#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14214#L71 assume !(0 == mp_add_~i~0 % 256); 14213#L71-2 assume !(1 == mp_add_~i~0 % 256); 14212#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 14211#L73-1 assume !(3 == mp_add_~i~0 % 256); 14209#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14208#L76-1 assume !(0 == mp_add_~i~0 % 256); 14207#L80-1 assume !(1 == mp_add_~i~0 % 256); 14206#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 14205#L82-1 assume !(3 == mp_add_~i~0 % 256); 14204#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14203#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14201#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 14199#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 14196#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 14194#L76-1 assume !(0 == mp_add_~i~0 % 256); 14189#L80-1 assume !(1 == mp_add_~i~0 % 256); 14177#L81-1 assume !(2 == mp_add_~i~0 % 256); 14159#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 14153#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14148#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14145#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 14143#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 14142#L71 assume !(0 == mp_add_~i~0 % 256); 14141#L71-2 assume !(1 == mp_add_~i~0 % 256); 14139#L72-1 assume !(2 == mp_add_~i~0 % 256); 14136#L73-1 assume !(3 == mp_add_~i~0 % 256); 14132#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 14129#L76-1 assume !(0 == mp_add_~i~0 % 256); 14125#L80-1 assume !(1 == mp_add_~i~0 % 256); 14126#L81-1 assume !(2 == mp_add_~i~0 % 256); 14122#L82-1 assume !(3 == mp_add_~i~0 % 256); 14121#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 14120#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 14117#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 14118#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 14188#L65-2 [2019-11-15 21:30:05,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:05,592 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 12 times [2019-11-15 21:30:05,592 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:05,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650295213] [2019-11-15 21:30:05,592 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:05,593 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:05,593 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:05,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:05,615 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:05,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:05,615 INFO L82 PathProgramCache]: Analyzing trace with hash -588052773, now seen corresponding path program 3 times [2019-11-15 21:30:05,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:05,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187219019] [2019-11-15 21:30:05,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:05,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:05,616 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:05,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 95 proven. 15 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-15 21:30:06,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187219019] [2019-11-15 21:30:06,067 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [296759424] [2019-11-15 21:30:06,067 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:30:06,110 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2019-11-15 21:30:06,110 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:30:06,111 INFO L256 TraceCheckSpWp]: Trace formula consists of 32 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:30:06,123 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:30:06,415 WARN L860 $PredicateComparison]: unable to prove that (exists ((ULTIMATE.start_mp_add_~nb~0 Int)) (< (mod c_ULTIMATE.start_mp_add_~i~0 256) (mod ULTIMATE.start_mp_add_~nb~0 256))) is different from true [2019-11-15 21:30:07,523 WARN L191 SmtUtils]: Spent 259.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-11-15 21:30:08,144 WARN L191 SmtUtils]: Spent 266.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-11-15 21:30:08,805 WARN L191 SmtUtils]: Spent 317.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-11-15 21:30:09,128 WARN L191 SmtUtils]: Spent 269.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2019-11-15 21:30:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-15 21:30:09,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:30:09,375 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [16] total 22 [2019-11-15 21:30:09,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293656410] [2019-11-15 21:30:09,375 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:30:09,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:30:09,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:30:09,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=336, Unknown=6, NotChecked=38, Total=462 [2019-11-15 21:30:09,376 INFO L87 Difference]: Start difference. First operand 701 states and 920 transitions. cyclomatic complexity: 223 Second operand 8 states. [2019-11-15 21:30:12,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:30:12,377 INFO L93 Difference]: Finished difference Result 966 states and 1210 transitions. [2019-11-15 21:30:12,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:30:12,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 966 states and 1210 transitions. [2019-11-15 21:30:12,387 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 933 [2019-11-15 21:30:12,396 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 966 states to 966 states and 1210 transitions. [2019-11-15 21:30:12,396 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 966 [2019-11-15 21:30:12,397 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 966 [2019-11-15 21:30:12,397 INFO L73 IsDeterministic]: Start isDeterministic. Operand 966 states and 1210 transitions. [2019-11-15 21:30:12,399 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:30:12,400 INFO L688 BuchiCegarLoop]: Abstraction has 966 states and 1210 transitions. [2019-11-15 21:30:12,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states and 1210 transitions. [2019-11-15 21:30:12,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 832. [2019-11-15 21:30:12,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 832 states. [2019-11-15 21:30:12,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 832 states to 832 states and 1069 transitions. [2019-11-15 21:30:12,420 INFO L711 BuchiCegarLoop]: Abstraction has 832 states and 1069 transitions. [2019-11-15 21:30:12,420 INFO L591 BuchiCegarLoop]: Abstraction has 832 states and 1069 transitions. [2019-11-15 21:30:12,420 INFO L424 BuchiCegarLoop]: ======== Iteration 16============ [2019-11-15 21:30:12,421 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 832 states and 1069 transitions. [2019-11-15 21:30:12,425 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 799 [2019-11-15 21:30:12,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:30:12,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:30:12,428 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:12,428 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:30:12,429 INFO L791 eck$LassoCheckResult]: Stem: 15756#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 15730#L40 assume !(0 == mp_add_~a3~0 % 256); 15731#L40-1 mp_add_~nb~0 := 4; 15749#L50 assume !(0 == mp_add_~b3~0 % 256); 15750#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 15765#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15766#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15760#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15735#L65-2 [2019-11-15 21:30:12,429 INFO L793 eck$LassoCheckResult]: Loop: 15735#L65-2 assume !(1 == mp_add_~i~0 % 256); 15736#L66-1 assume !(2 == mp_add_~i~0 % 256); 16547#L67-1 assume !(3 == mp_add_~i~0 % 256); 16548#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16552#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 16480#L71-2 assume !(1 == mp_add_~i~0 % 256); 15748#L72-1 assume !(2 == mp_add_~i~0 % 256); 15733#L73-1 assume !(3 == mp_add_~i~0 % 256); 15734#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 15737#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 15721#L80-1 assume !(1 == mp_add_~i~0 % 256); 15722#L81-1 assume !(2 == mp_add_~i~0 % 256); 15744#L82-1 assume !(3 == mp_add_~i~0 % 256); 16542#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 15745#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 15746#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16541#L65 assume !(0 == mp_add_~i~0 % 256); 16540#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 16518#L66-1 assume !(2 == mp_add_~i~0 % 256); 16539#L67-1 assume !(3 == mp_add_~i~0 % 256); 16538#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16537#L71 assume !(0 == mp_add_~i~0 % 256); 16536#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 16469#L72-1 assume !(2 == mp_add_~i~0 % 256); 16535#L73-1 assume !(3 == mp_add_~i~0 % 256); 16534#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 16533#L76-1 assume !(0 == mp_add_~i~0 % 256); 16532#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 16440#L81-1 assume !(2 == mp_add_~i~0 % 256); 16529#L82-1 assume !(3 == mp_add_~i~0 % 256); 16523#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16522#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16521#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 16520#L65 assume !(0 == mp_add_~i~0 % 256); 16519#L65-2 assume !(1 == mp_add_~i~0 % 256); 16517#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 16473#L67-1 assume !(3 == mp_add_~i~0 % 256); 16516#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16513#L71 assume !(0 == mp_add_~i~0 % 256); 16512#L71-2 assume !(1 == mp_add_~i~0 % 256); 16511#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 16510#L73-1 assume !(3 == mp_add_~i~0 % 256); 16509#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16507#L76-1 assume !(0 == mp_add_~i~0 % 256); 16505#L80-1 assume !(1 == mp_add_~i~0 % 256); 16503#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 16501#L82-1 assume !(3 == mp_add_~i~0 % 256); 16464#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16465#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16455#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16457#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 16452#L71 assume !(0 == mp_add_~i~0 % 256); 16451#L71-2 assume !(1 == mp_add_~i~0 % 256); 16449#L72-1 assume !(2 == mp_add_~i~0 % 256); 16447#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 16443#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 16441#L76-1 assume !(0 == mp_add_~i~0 % 256); 16438#L80-1 assume !(1 == mp_add_~i~0 % 256); 16436#L81-1 assume !(2 == mp_add_~i~0 % 256); 16432#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 16428#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16429#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16423#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 16425#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 15999#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 15782#L76-1 assume !(0 == mp_add_~i~0 % 256); 15778#L80-1 assume !(1 == mp_add_~i~0 % 256); 15779#L81-1 assume !(2 == mp_add_~i~0 % 256); 16130#L82-1 assume !(3 == mp_add_~i~0 % 256); 16119#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 16118#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 16116#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 15761#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 15735#L65-2 [2019-11-15 21:30:12,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 13 times [2019-11-15 21:30:12,430 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:12,430 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878695578] [2019-11-15 21:30:12,430 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:12,431 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:12,431 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:12,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:30:12,454 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:30:12,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:30:12,455 INFO L82 PathProgramCache]: Analyzing trace with hash -1450784191, now seen corresponding path program 1 times [2019-11-15 21:30:12,455 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:30:12,455 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [695315011] [2019-11-15 21:30:12,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:12,456 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:30:12,456 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:30:12,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 13 proven. 113 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:30:12,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [695315011] [2019-11-15 21:30:12,628 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224431272] [2019-11-15 21:30:12,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:30:12,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:30:12,697 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:30:12,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:31:12,935 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 54 proven. 8 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-11-15 21:31:12,936 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:31:12,936 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 9 [2019-11-15 21:31:12,936 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898676434] [2019-11-15 21:31:12,937 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:31:12,937 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:31:12,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:31:12,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=66, Unknown=5, NotChecked=0, Total=90 [2019-11-15 21:31:12,938 INFO L87 Difference]: Start difference. First operand 832 states and 1069 transitions. cyclomatic complexity: 241 Second operand 10 states. [2019-11-15 21:33:14,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:14,393 INFO L93 Difference]: Finished difference Result 1638 states and 1969 transitions. [2019-11-15 21:33:14,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:33:14,394 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1638 states and 1969 transitions. [2019-11-15 21:33:14,403 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1605 [2019-11-15 21:33:14,415 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1638 states to 1638 states and 1969 transitions. [2019-11-15 21:33:14,416 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1638 [2019-11-15 21:33:14,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1638 [2019-11-15 21:33:14,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1638 states and 1969 transitions. [2019-11-15 21:33:14,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:33:14,421 INFO L688 BuchiCegarLoop]: Abstraction has 1638 states and 1969 transitions. [2019-11-15 21:33:14,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1638 states and 1969 transitions. [2019-11-15 21:33:14,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1638 to 1128. [2019-11-15 21:33:14,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1128 states. [2019-11-15 21:33:14,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1128 states to 1128 states and 1413 transitions. [2019-11-15 21:33:14,446 INFO L711 BuchiCegarLoop]: Abstraction has 1128 states and 1413 transitions. [2019-11-15 21:33:14,446 INFO L591 BuchiCegarLoop]: Abstraction has 1128 states and 1413 transitions. [2019-11-15 21:33:14,447 INFO L424 BuchiCegarLoop]: ======== Iteration 17============ [2019-11-15 21:33:14,447 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1128 states and 1413 transitions. [2019-11-15 21:33:14,451 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1095 [2019-11-15 21:33:14,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:33:14,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:33:14,452 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:33:14,453 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:33:14,453 INFO L791 eck$LassoCheckResult]: Stem: 18456#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 18430#L40 assume !(0 == mp_add_~a3~0 % 256); 18431#L40-1 mp_add_~nb~0 := 4; 18697#L50 assume !(0 == mp_add_~b3~0 % 256); 18696#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 18695#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18694#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18693#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18547#L65-2 [2019-11-15 21:33:14,453 INFO L793 eck$LassoCheckResult]: Loop: 18547#L65-2 assume !(1 == mp_add_~i~0 % 256); 18692#L66-1 assume !(2 == mp_add_~i~0 % 256); 18691#L67-1 assume !(3 == mp_add_~i~0 % 256); 18690#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18689#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 18625#L71-2 assume !(1 == mp_add_~i~0 % 256); 18688#L72-1 assume !(2 == mp_add_~i~0 % 256); 18687#L73-1 assume !(3 == mp_add_~i~0 % 256); 18686#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 18685#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 18585#L80-1 assume !(1 == mp_add_~i~0 % 256); 18684#L81-1 assume !(2 == mp_add_~i~0 % 256); 18683#L82-1 assume !(3 == mp_add_~i~0 % 256); 18682#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18681#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18680#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18679#L65 assume !(0 == mp_add_~i~0 % 256); 18678#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 18609#L66-1 assume !(2 == mp_add_~i~0 % 256); 18677#L67-1 assume !(3 == mp_add_~i~0 % 256); 18676#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18675#L71 assume !(0 == mp_add_~i~0 % 256); 18674#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 18621#L72-1 assume !(2 == mp_add_~i~0 % 256); 18673#L73-1 assume !(3 == mp_add_~i~0 % 256); 18672#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 18671#L76-1 assume !(0 == mp_add_~i~0 % 256); 18670#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 18582#L81-1 assume !(2 == mp_add_~i~0 % 256); 18669#L82-1 assume !(3 == mp_add_~i~0 % 256); 18668#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18636#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18634#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18632#L65 assume !(0 == mp_add_~i~0 % 256); 18630#L65-2 assume !(1 == mp_add_~i~0 % 256); 18629#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 18540#L67-1 assume !(3 == mp_add_~i~0 % 256); 18628#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18626#L71 assume !(0 == mp_add_~i~0 % 256); 18622#L71-2 assume !(1 == mp_add_~i~0 % 256); 18618#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 18616#L73-1 assume !(3 == mp_add_~i~0 % 256); 18613#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18611#L76-1 assume !(0 == mp_add_~i~0 % 256); 18607#L80-1 assume !(1 == mp_add_~i~0 % 256); 18604#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 18600#L82-1 assume !(3 == mp_add_~i~0 % 256); 18598#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18597#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18594#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 18591#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18592#L71 assume !(0 == mp_add_~i~0 % 256); 18596#L71-2 assume !(1 == mp_add_~i~0 % 256); 18593#L72-1 assume !(2 == mp_add_~i~0 % 256); 18590#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 18589#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18667#L76-1 assume !(0 == mp_add_~i~0 % 256); 18664#L80-1 assume !(1 == mp_add_~i~0 % 256); 18661#L81-1 assume !(2 == mp_add_~i~0 % 256); 18658#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 18656#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18655#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18652#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 18649#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 18647#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 18563#L76-1 assume !(0 == mp_add_~i~0 % 256); 18646#L80-1 assume !(1 == mp_add_~i~0 % 256); 18645#L81-1 assume !(2 == mp_add_~i~0 % 256); 18644#L82-1 assume !(3 == mp_add_~i~0 % 256); 18643#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18641#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18638#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 18635#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 18633#L71 assume !(0 == mp_add_~i~0 % 256); 18631#L71-2 assume !(1 == mp_add_~i~0 % 256); 18554#L72-1 assume !(2 == mp_add_~i~0 % 256); 18551#L73-1 assume !(3 == mp_add_~i~0 % 256); 18552#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 18703#L76-1 assume !(0 == mp_add_~i~0 % 256); 18702#L80-1 assume !(1 == mp_add_~i~0 % 256); 18701#L81-1 assume !(2 == mp_add_~i~0 % 256); 18523#L82-1 assume !(3 == mp_add_~i~0 % 256); 18522#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18521#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18519#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 18515#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 18511#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 18512#L76-1 assume !(0 == mp_add_~i~0 % 256); 18700#L80-1 assume !(1 == mp_add_~i~0 % 256); 18699#L81-1 assume !(2 == mp_add_~i~0 % 256); 18542#L82-1 assume !(3 == mp_add_~i~0 % 256); 18536#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 18534#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 18529#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 18530#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 18547#L65-2 [2019-11-15 21:33:14,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:14,454 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 14 times [2019-11-15 21:33:14,454 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:14,454 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1623969698] [2019-11-15 21:33:14,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:14,454 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:14,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:14,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:33:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:33:14,468 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:33:14,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:14,468 INFO L82 PathProgramCache]: Analyzing trace with hash 2113479413, now seen corresponding path program 2 times [2019-11-15 21:33:14,469 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:14,469 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435212994] [2019-11-15 21:33:14,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:14,469 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:14,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:14,783 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 160 proven. 9 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-11-15 21:33:14,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435212994] [2019-11-15 21:33:14,783 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422898189] [2019-11-15 21:33:14,783 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:14,842 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-15 21:33:14,842 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:33:14,843 INFO L256 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 21:33:14,845 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:14,886 INFO L134 CoverageAnalysis]: Checked inductivity of 241 backedges. 145 proven. 40 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-11-15 21:33:14,886 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:33:14,887 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4] total 13 [2019-11-15 21:33:14,887 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255233716] [2019-11-15 21:33:14,887 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:33:14,888 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:14,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-11-15 21:33:14,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2019-11-15 21:33:14,888 INFO L87 Difference]: Start difference. First operand 1128 states and 1413 transitions. cyclomatic complexity: 289 Second operand 13 states. [2019-11-15 21:33:16,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:16,904 INFO L93 Difference]: Finished difference Result 1953 states and 2195 transitions. [2019-11-15 21:33:16,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-11-15 21:33:16,904 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1953 states and 2195 transitions. [2019-11-15 21:33:16,916 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1667 [2019-11-15 21:33:16,929 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1953 states to 1862 states and 2093 transitions. [2019-11-15 21:33:16,929 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1862 [2019-11-15 21:33:16,930 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1862 [2019-11-15 21:33:16,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1862 states and 2093 transitions. [2019-11-15 21:33:16,933 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:33:16,934 INFO L688 BuchiCegarLoop]: Abstraction has 1862 states and 2093 transitions. [2019-11-15 21:33:16,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states and 2093 transitions. [2019-11-15 21:33:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1035. [2019-11-15 21:33:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1035 states. [2019-11-15 21:33:16,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1226 transitions. [2019-11-15 21:33:16,958 INFO L711 BuchiCegarLoop]: Abstraction has 1035 states and 1226 transitions. [2019-11-15 21:33:16,958 INFO L591 BuchiCegarLoop]: Abstraction has 1035 states and 1226 transitions. [2019-11-15 21:33:16,958 INFO L424 BuchiCegarLoop]: ======== Iteration 18============ [2019-11-15 21:33:16,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1035 states and 1226 transitions. [2019-11-15 21:33:16,961 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 930 [2019-11-15 21:33:16,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:33:16,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:33:16,962 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:33:16,962 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:33:16,962 INFO L791 eck$LassoCheckResult]: Stem: 21954#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 21928#L40 assume !(0 == mp_add_~a3~0 % 256); 21929#L40-1 mp_add_~nb~0 := 4; 22179#L50 assume !(0 == mp_add_~b3~0 % 256); 22178#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 22177#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22176#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22175#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22043#L65-2 [2019-11-15 21:33:16,963 INFO L793 eck$LassoCheckResult]: Loop: 22043#L65-2 assume !(1 == mp_add_~i~0 % 256); 22174#L66-1 assume !(2 == mp_add_~i~0 % 256); 22173#L67-1 assume !(3 == mp_add_~i~0 % 256); 22172#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22171#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 22094#L71-2 assume !(1 == mp_add_~i~0 % 256); 22170#L72-1 assume !(2 == mp_add_~i~0 % 256); 22169#L73-1 assume !(3 == mp_add_~i~0 % 256); 22168#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 22167#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 22077#L80-1 assume !(1 == mp_add_~i~0 % 256); 22166#L81-1 assume !(2 == mp_add_~i~0 % 256); 22165#L82-1 assume !(3 == mp_add_~i~0 % 256); 22164#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22163#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22162#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22161#L65 assume !(0 == mp_add_~i~0 % 256); 22160#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 22121#L66-1 assume !(2 == mp_add_~i~0 % 256); 22159#L67-1 assume !(3 == mp_add_~i~0 % 256); 22158#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22157#L71 assume !(0 == mp_add_~i~0 % 256); 22156#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 22092#L72-1 assume !(2 == mp_add_~i~0 % 256); 22155#L73-1 assume !(3 == mp_add_~i~0 % 256); 22154#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 22153#L76-1 assume !(0 == mp_add_~i~0 % 256); 22152#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 22119#L81-1 assume !(2 == mp_add_~i~0 % 256); 22151#L82-1 assume !(3 == mp_add_~i~0 % 256); 22150#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22149#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22148#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22147#L65 assume !(0 == mp_add_~i~0 % 256); 22146#L65-2 assume !(1 == mp_add_~i~0 % 256); 22145#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 22038#L67-1 assume !(3 == mp_add_~i~0 % 256); 22144#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22143#L71 assume !(0 == mp_add_~i~0 % 256); 22142#L71-2 assume !(1 == mp_add_~i~0 % 256); 22141#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 22088#L73-1 assume !(3 == mp_add_~i~0 % 256); 22140#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 22139#L76-1 assume !(0 == mp_add_~i~0 % 256); 22138#L80-1 assume !(1 == mp_add_~i~0 % 256); 22137#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 22136#L82-1 assume !(3 == mp_add_~i~0 % 256); 22135#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22133#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22130#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22120#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22128#L71 assume !(0 == mp_add_~i~0 % 256); 22127#L71-2 assume !(1 == mp_add_~i~0 % 256); 22126#L72-1 assume !(2 == mp_add_~i~0 % 256); 22125#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 22084#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 22124#L76-1 assume !(0 == mp_add_~i~0 % 256); 22123#L80-1 assume !(1 == mp_add_~i~0 % 256); 22122#L81-1 assume !(2 == mp_add_~i~0 % 256); 22118#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 22115#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22111#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22108#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22106#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22105#L71 assume !(0 == mp_add_~i~0 % 256); 22104#L71-2 assume !(1 == mp_add_~i~0 % 256); 22101#L72-1 assume !(2 == mp_add_~i~0 % 256); 22098#L73-1 assume !(3 == mp_add_~i~0 % 256); 22095#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 22086#L76-1 assume !(0 == mp_add_~i~0 % 256); 22082#L80-1 assume !(1 == mp_add_~i~0 % 256); 22079#L81-1 assume !(2 == mp_add_~i~0 % 256); 22075#L82-1 assume !(3 == mp_add_~i~0 % 256); 22072#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22068#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22065#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22063#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22062#L71 assume !(0 == mp_add_~i~0 % 256); 22061#L71-2 assume !(1 == mp_add_~i~0 % 256); 22060#L72-1 assume !(2 == mp_add_~i~0 % 256); 22059#L73-1 assume !(3 == mp_add_~i~0 % 256); 22058#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 22057#L76-1 assume !(0 == mp_add_~i~0 % 256); 22056#L80-1 assume !(1 == mp_add_~i~0 % 256); 22055#L81-1 assume !(2 == mp_add_~i~0 % 256); 22054#L82-1 assume !(3 == mp_add_~i~0 % 256); 22052#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22050#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22047#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 22033#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 22099#L71 assume !(0 == mp_add_~i~0 % 256); 22100#L71-2 assume !(1 == mp_add_~i~0 % 256); 22089#L72-1 assume !(2 == mp_add_~i~0 % 256); 22090#L73-1 assume !(3 == mp_add_~i~0 % 256); 22080#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 22081#L76-1 assume !(0 == mp_add_~i~0 % 256); 22073#L80-1 assume !(1 == mp_add_~i~0 % 256); 22074#L81-1 assume !(2 == mp_add_~i~0 % 256); 22053#L82-1 assume !(3 == mp_add_~i~0 % 256); 22051#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 22049#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 22045#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 22042#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 22043#L65-2 [2019-11-15 21:33:16,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:16,963 INFO L82 PathProgramCache]: Analyzing trace with hash -661484145, now seen corresponding path program 15 times [2019-11-15 21:33:16,963 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:16,964 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2076384847] [2019-11-15 21:33:16,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:16,964 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:16,964 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:33:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:33:16,981 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:33:16,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:16,982 INFO L82 PathProgramCache]: Analyzing trace with hash 561368335, now seen corresponding path program 1 times [2019-11-15 21:33:16,983 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:16,983 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023748541] [2019-11-15 21:33:16,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:16,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:16,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 18 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:33:17,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023748541] [2019-11-15 21:33:17,191 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745968370] [2019-11-15 21:33:17,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:17,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 21:33:17,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 285 backedges. 138 proven. 53 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-11-15 21:33:27,130 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:33:27,130 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 15 [2019-11-15 21:33:27,130 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358884561] [2019-11-15 21:33:27,131 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 21:33:27,131 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:27,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-11-15 21:33:27,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=189, Unknown=16, NotChecked=0, Total=240 [2019-11-15 21:33:27,132 INFO L87 Difference]: Start difference. First operand 1035 states and 1226 transitions. cyclomatic complexity: 195 Second operand 16 states. [2019-11-15 21:33:30,531 WARN L191 SmtUtils]: Spent 858.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 22 [2019-11-15 21:33:31,598 WARN L191 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 30 DAG size of output: 26 [2019-11-15 21:33:32,781 WARN L191 SmtUtils]: Spent 1.06 s on a formula simplification. DAG size of input: 30 DAG size of output: 23 [2019-11-15 21:33:34,496 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 33 DAG size of output: 26 [2019-11-15 21:33:35,394 WARN L191 SmtUtils]: Spent 856.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 22 [2019-11-15 21:33:36,605 WARN L191 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 33 DAG size of output: 23 [2019-11-15 21:33:37,622 WARN L191 SmtUtils]: Spent 578.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 32 [2019-11-15 21:33:38,398 WARN L191 SmtUtils]: Spent 635.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 34 [2019-11-15 21:33:39,558 WARN L191 SmtUtils]: Spent 560.00 ms on a formula simplification that was a NOOP. DAG size: 32 [2019-11-15 21:33:40,390 WARN L191 SmtUtils]: Spent 720.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 36 [2019-11-15 21:33:41,136 WARN L191 SmtUtils]: Spent 688.00 ms on a formula simplification. DAG size of input: 41 DAG size of output: 31 [2019-11-15 21:33:43,217 WARN L191 SmtUtils]: Spent 1.84 s on a formula simplification. DAG size of input: 37 DAG size of output: 32 [2019-11-15 21:33:44,839 WARN L191 SmtUtils]: Spent 674.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2019-11-15 21:33:46,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:46,065 INFO L93 Difference]: Finished difference Result 1597 states and 1771 transitions. [2019-11-15 21:33:46,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-11-15 21:33:46,066 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1597 states and 1771 transitions. [2019-11-15 21:33:46,070 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 138 [2019-11-15 21:33:46,079 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1597 states to 1597 states and 1771 transitions. [2019-11-15 21:33:46,079 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1597 [2019-11-15 21:33:46,080 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1597 [2019-11-15 21:33:46,080 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1597 states and 1771 transitions. [2019-11-15 21:33:46,083 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:33:46,083 INFO L688 BuchiCegarLoop]: Abstraction has 1597 states and 1771 transitions. [2019-11-15 21:33:46,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1597 states and 1771 transitions. [2019-11-15 21:33:46,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1597 to 548. [2019-11-15 21:33:46,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 548 states. [2019-11-15 21:33:46,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 630 transitions. [2019-11-15 21:33:46,102 INFO L711 BuchiCegarLoop]: Abstraction has 548 states and 630 transitions. [2019-11-15 21:33:46,102 INFO L591 BuchiCegarLoop]: Abstraction has 548 states and 630 transitions. [2019-11-15 21:33:46,102 INFO L424 BuchiCegarLoop]: ======== Iteration 19============ [2019-11-15 21:33:46,102 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 548 states and 630 transitions. [2019-11-15 21:33:46,104 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 35 [2019-11-15 21:33:46,104 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:33:46,104 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:33:46,105 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:33:46,105 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:33:46,106 INFO L791 eck$LassoCheckResult]: Stem: 24966#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 24944#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 24946#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 24962#L44 assume !(0 == mp_add_~a1~0 % 256); 24940#L40-1 mp_add_~nb~0 := 4; 24941#L50 assume !(0 == mp_add_~b3~0 % 256); 25111#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 25110#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25108#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25109#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25102#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 25115#L71-2 assume !(1 == mp_add_~i~0 % 256); 25114#L72-1 assume !(2 == mp_add_~i~0 % 256); 25100#L73-1 assume !(3 == mp_add_~i~0 % 256); 25098#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 25099#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 25136#L80-1 assume !(1 == mp_add_~i~0 % 256); 25135#L81-1 assume !(2 == mp_add_~i~0 % 256); 25133#L82-1 assume !(3 == mp_add_~i~0 % 256); 25134#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25129#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25130#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25157#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25152#L71 assume !(0 == mp_add_~i~0 % 256); 25153#L71-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b1~0 % 256; 25148#L72-1 assume !(2 == mp_add_~i~0 % 256); 25149#L73-1 assume !(3 == mp_add_~i~0 % 256); 25082#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 25083#L76-1 assume !(0 == mp_add_~i~0 % 256); 25077#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 25078#L81-1 assume !(2 == mp_add_~i~0 % 256); 25073#L82-1 assume !(3 == mp_add_~i~0 % 256); 25074#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25296#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25291#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 25288#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25287#L71 assume !(0 == mp_add_~i~0 % 256); 25286#L71-2 assume !(1 == mp_add_~i~0 % 256); 25285#L72-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b2~0 % 256; 25284#L73-1 assume !(3 == mp_add_~i~0 % 256); 25282#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 25283#L76-1 assume !(0 == mp_add_~i~0 % 256); 25274#L80-1 assume !(1 == mp_add_~i~0 % 256); 25275#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 25266#L82-1 assume !(3 == mp_add_~i~0 % 256); 25267#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25257#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25256#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24965#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 25240#L71 assume !(0 == mp_add_~i~0 % 256); 25442#L71-2 assume !(1 == mp_add_~i~0 % 256); 25441#L72-1 assume !(2 == mp_add_~i~0 % 256); 25440#L73-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b3~0 % 256; 25439#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 25438#L76-1 assume !(0 == mp_add_~i~0 % 256); 25436#L80-1 assume !(1 == mp_add_~i~0 % 256); 25434#L81-1 assume !(2 == mp_add_~i~0 % 256); 25432#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 25430#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 25428#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 25426#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24974#L64-1 [2019-11-15 21:33:46,106 INFO L793 eck$LassoCheckResult]: Loop: 24974#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 24939#L71 assume !(0 == mp_add_~i~0 % 256); 24935#L71-2 assume !(1 == mp_add_~i~0 % 256); 24936#L72-1 assume !(2 == mp_add_~i~0 % 256); 24942#L73-1 assume !(3 == mp_add_~i~0 % 256); 24943#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 24949#L76-1 assume !(0 == mp_add_~i~0 % 256); 24933#L80-1 assume !(1 == mp_add_~i~0 % 256); 24934#L81-1 assume !(2 == mp_add_~i~0 % 256); 24937#L82-1 assume !(3 == mp_add_~i~0 % 256); 24938#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 24955#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 24956#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 24974#L64-1 [2019-11-15 21:33:46,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:46,107 INFO L82 PathProgramCache]: Analyzing trace with hash 472272938, now seen corresponding path program 1 times [2019-11-15 21:33:46,107 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:46,107 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445847993] [2019-11-15 21:33:46,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:46,107 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:46,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:46,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:46,383 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 21:33:46,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445847993] [2019-11-15 21:33:46,383 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309237352] [2019-11-15 21:33:46,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:33:46,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:46,447 INFO L256 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 16 conjunts are in the unsatisfiable core [2019-11-15 21:33:46,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:33:46,561 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 21:33:46,649 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 40 proven. 7 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-11-15 21:33:46,650 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:33:46,650 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6] total 14 [2019-11-15 21:33:46,650 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523998991] [2019-11-15 21:33:46,651 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:33:46,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:46,652 INFO L82 PathProgramCache]: Analyzing trace with hash 2135525127, now seen corresponding path program 1 times [2019-11-15 21:33:46,652 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:46,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659449445] [2019-11-15 21:33:46,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:46,652 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:46,652 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:46,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:33:46,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:33:46,660 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:33:46,784 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:33:46,786 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:33:46,786 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:33:46,786 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:33:46,786 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:33:46,787 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:33:46,787 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:33:46,787 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:33:46,787 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration19_Loop [2019-11-15 21:33:46,787 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:33:46,788 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:33:46,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:33:47,124 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-11-15 21:33:47,572 WARN L191 SmtUtils]: Spent 446.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-11-15 21:33:47,577 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:33:47,577 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:33:47,583 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:33:47,583 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:33:47,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:33:47,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:33:49,078 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:33:49,081 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:33:49,081 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:33:49,081 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:33:49,081 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:33:49,081 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:33:49,081 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:33:49,082 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:33:49,082 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:33:49,082 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration19_Loop [2019-11-15 21:33:49,082 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:33:49,082 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:33:49,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-11-15 21:33:49,449 WARN L191 SmtUtils]: Spent 305.00 ms on a formula simplification. DAG size of input: 96 DAG size of output: 75 [2019-11-15 21:33:49,872 WARN L191 SmtUtils]: Spent 421.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 76 [2019-11-15 21:33:49,873 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:33:49,878 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:33:49,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:33:49,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:33:49,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:33:49,881 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:33:49,881 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:33:49,881 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:33:49,888 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:33:49,888 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:33:49,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:33:49,900 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:33:49,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:33:49,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:33:49,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:33:49,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:33:49,902 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:33:49,902 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:33:49,908 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:33:49,908 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:33:49,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:33:49,924 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 21:33:49,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-11-15 21:33:49,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:33:49,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:33:49,926 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:33:49,926 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:33:49,926 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:33:49,931 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:33:49,931 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:33:49,951 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:33:49,951 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 21:33:49,951 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:33:49,952 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:33:49,953 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:33:49,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:33:49,953 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:33:49,953 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:33:49,959 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 21:33:49,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:33:49,983 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:33:49,983 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 21:33:49,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-11-15 21:33:49,984 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:33:49,984 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:33:49,985 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:33:49,985 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:33:49,985 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:33:49,985 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:33:50,021 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:33:50,021 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:33:50,048 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:33:50,049 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 21:33:50,049 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:33:50,050 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:33:50,050 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:33:50,050 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:33:50,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:33:50,052 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:33:50,052 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:33:50,068 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:33:50,069 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:33:50,124 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:33:50,124 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 21:33:50,125 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:33:50,126 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:33:50,126 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:33:50,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:33:50,127 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:33:50,127 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:33:50,127 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:33:50,152 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 21:33:50,153 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:33:50,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:33:50,209 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 21:33:50,210 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:33:50,210 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:33:50,211 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:33:50,211 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:33:50,211 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:33:50,211 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:33:50,211 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:33:50,216 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 21:33:50,216 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:33:50,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:33:50,245 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 21:33:50,245 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:33:50,246 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:33:50,246 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:33:50,246 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:33:50,247 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:33:50,247 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 21:33:50,247 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:33:50,256 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 21:33:50,256 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:33:50,365 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:33:50,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:33:50,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-11-15 21:33:50,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2019-11-15 21:33:50,366 INFO L87 Difference]: Start difference. First operand 548 states and 630 transitions. cyclomatic complexity: 84 Second operand 15 states. [2019-11-15 21:33:57,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:33:57,796 INFO L93 Difference]: Finished difference Result 1442 states and 1576 transitions. [2019-11-15 21:33:57,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-11-15 21:33:57,796 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1442 states and 1576 transitions. [2019-11-15 21:33:57,800 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 60 [2019-11-15 21:33:57,805 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1442 states to 1248 states and 1374 transitions. [2019-11-15 21:33:57,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1248 [2019-11-15 21:33:57,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1248 [2019-11-15 21:33:57,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1248 states and 1374 transitions. [2019-11-15 21:33:57,808 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:33:57,808 INFO L688 BuchiCegarLoop]: Abstraction has 1248 states and 1374 transitions. [2019-11-15 21:33:57,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states and 1374 transitions. [2019-11-15 21:33:57,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 679. [2019-11-15 21:33:57,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2019-11-15 21:33:57,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 776 transitions. [2019-11-15 21:33:57,824 INFO L711 BuchiCegarLoop]: Abstraction has 679 states and 776 transitions. [2019-11-15 21:33:57,824 INFO L591 BuchiCegarLoop]: Abstraction has 679 states and 776 transitions. [2019-11-15 21:33:57,824 INFO L424 BuchiCegarLoop]: ======== Iteration 20============ [2019-11-15 21:33:57,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 679 states and 776 transitions. [2019-11-15 21:33:57,826 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 31 [2019-11-15 21:33:57,826 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:33:57,827 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:33:57,827 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:33:57,828 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:33:57,828 INFO L791 eck$LassoCheckResult]: Stem: 27245#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 27219#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 27221#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 27241#L44 assume !(0 == mp_add_~a1~0 % 256); 27215#L40-1 mp_add_~nb~0 := 4; 27216#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 27239#L52 assume !(0 == mp_add_~b2~0 % 256); 27226#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 27325#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27323#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27322#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 27321#L65-2 assume !(1 == mp_add_~i~0 % 256); 27320#L66-1 assume !(2 == mp_add_~i~0 % 256); 27319#L67-1 assume !(3 == mp_add_~i~0 % 256); 27316#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27318#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 27472#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 27473#L80-1 assume !(1 == mp_add_~i~0 % 256); 27468#L81-1 assume !(2 == mp_add_~i~0 % 256); 27469#L82-1 assume !(3 == mp_add_~i~0 % 256); 27463#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27464#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27457#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27458#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27482#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 27410#L76-1 assume !(0 == mp_add_~i~0 % 256); 27481#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 27480#L81-1 assume !(2 == mp_add_~i~0 % 256); 27479#L82-1 assume !(3 == mp_add_~i~0 % 256); 27381#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27376#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27365#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27364#L65 assume !(0 == mp_add_~i~0 % 256); 27363#L65-2 assume !(1 == mp_add_~i~0 % 256); 27362#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 27361#L67-1 assume !(3 == mp_add_~i~0 % 256); 27360#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27357#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 27846#L76-1 assume !(0 == mp_add_~i~0 % 256); 27845#L80-1 assume !(1 == mp_add_~i~0 % 256); 27844#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 27711#L82-1 assume !(3 == mp_add_~i~0 % 256); 27509#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27506#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27507#L64 assume !(mp_add_~i~0 % 256 < mp_add_~na~0 % 256); 27870#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27871#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 27491#L76-1 assume !(0 == mp_add_~i~0 % 256); 27885#L80-1 assume !(1 == mp_add_~i~0 % 256); 27884#L81-1 assume !(2 == mp_add_~i~0 % 256); 27883#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 27212#L83-1 [2019-11-15 21:33:57,828 INFO L793 eck$LassoCheckResult]: Loop: 27212#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 27230#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 27231#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 27227#L65 assume !(0 == mp_add_~i~0 % 256); 27222#L65-2 assume !(1 == mp_add_~i~0 % 256); 27223#L66-1 assume !(2 == mp_add_~i~0 % 256); 27246#L67-1 assume !(3 == mp_add_~i~0 % 256); 27240#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 27232#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 27224#L76-1 assume !(0 == mp_add_~i~0 % 256); 27207#L80-1 assume !(1 == mp_add_~i~0 % 256); 27208#L81-1 assume !(2 == mp_add_~i~0 % 256); 27211#L82-1 assume !(3 == mp_add_~i~0 % 256); 27212#L83-1 [2019-11-15 21:33:57,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:57,829 INFO L82 PathProgramCache]: Analyzing trace with hash 121381902, now seen corresponding path program 1 times [2019-11-15 21:33:57,829 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:57,829 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587020135] [2019-11-15 21:33:57,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:57,829 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:57,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:33:57,969 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 21:33:57,969 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587020135] [2019-11-15 21:33:57,969 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:33:57,969 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:33:57,970 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953156912] [2019-11-15 21:33:57,970 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:33:57,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:33:57,970 INFO L82 PathProgramCache]: Analyzing trace with hash 1978172715, now seen corresponding path program 1 times [2019-11-15 21:33:57,970 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:33:57,970 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951572431] [2019-11-15 21:33:57,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:57,971 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:33:57,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:33:57,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:33:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:33:57,979 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:33:58,073 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:33:58,073 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:33:58,073 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:33:58,073 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:33:58,074 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:33:58,074 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:33:58,074 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:33:58,074 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:33:58,074 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration20_Loop [2019-11-15 21:33:58,074 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:33:58,074 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:33:58,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:33:58,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-11-15 21:33:58,289 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:33:58,403 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:33:58,403 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:33:58,417 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:33:58,418 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:33:58,465 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:33:58,468 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:34:01,505 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:34:01,507 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:01,508 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:01,508 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:01,508 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:01,508 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:34:01,508 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:01,508 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:01,508 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:01,508 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration20_Loop [2019-11-15 21:34:01,508 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:01,508 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:01,509 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:01,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-11-15 21:34:01,733 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:01,839 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:01,839 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:34:01,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,840 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:01,840 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,840 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:01,841 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:01,841 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,845 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:01,845 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,845 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:01,846 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:01,846 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,847 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:34:01,847 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,847 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:01,848 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,849 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,849 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:01,850 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:01,850 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,855 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:01,856 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,856 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,857 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:01,857 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:01,857 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,858 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,859 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 21:34:01,859 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:01,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,860 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:01,861 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:01,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,867 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:01,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,869 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,869 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:01,869 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:01,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,871 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,871 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 21:34:01,871 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,872 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:01,872 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,872 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,872 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,873 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:01,874 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:01,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:01,881 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,882 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:01,883 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:01,883 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,884 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 21:34:01,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,885 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:01,885 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:01,886 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,886 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:01,887 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:01,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,898 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,900 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,901 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:01,901 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:01,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,902 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:01,904 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:01,904 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,906 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 21:34:01,907 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,908 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:01,908 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:01,908 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,908 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,909 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:01,911 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:01,912 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,922 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,922 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,923 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:01,923 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:01,923 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,924 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:01,931 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:01,932 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,934 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,934 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 21:34:01,935 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,935 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:01,936 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:01,936 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,936 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,936 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,936 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:01,939 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:01,939 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,961 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,962 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,962 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:01,962 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:01,963 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,963 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,963 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,963 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:01,965 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:01,965 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,967 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 21:34:01,968 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,968 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:01,968 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:01,968 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,969 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,969 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,969 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:01,970 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:01,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,985 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,986 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,987 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:01,987 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:01,987 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,989 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:01,990 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:01,990 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:01,994 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:01,994 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 21:34:01,995 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:01,996 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:01,996 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:01,996 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:01,997 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:01,997 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:01,997 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:01,999 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:01,999 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:02,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:02,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:02,041 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:02,041 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:02,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:02,043 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:02,043 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:02,043 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:02,044 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:02,045 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:02,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:02,052 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:02,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:34:02,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:34:02,052 INFO L87 Difference]: Start difference. First operand 679 states and 776 transitions. cyclomatic complexity: 99 Second operand 8 states. [2019-11-15 21:34:02,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:02,473 INFO L93 Difference]: Finished difference Result 1117 states and 1233 transitions. [2019-11-15 21:34:02,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-11-15 21:34:02,473 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1117 states and 1233 transitions. [2019-11-15 21:34:02,478 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 56 [2019-11-15 21:34:02,482 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1117 states to 654 states and 716 transitions. [2019-11-15 21:34:02,482 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 654 [2019-11-15 21:34:02,483 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 654 [2019-11-15 21:34:02,483 INFO L73 IsDeterministic]: Start isDeterministic. Operand 654 states and 716 transitions. [2019-11-15 21:34:02,484 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:34:02,484 INFO L688 BuchiCegarLoop]: Abstraction has 654 states and 716 transitions. [2019-11-15 21:34:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states and 716 transitions. [2019-11-15 21:34:02,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 429. [2019-11-15 21:34:02,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2019-11-15 21:34:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 478 transitions. [2019-11-15 21:34:02,494 INFO L711 BuchiCegarLoop]: Abstraction has 429 states and 478 transitions. [2019-11-15 21:34:02,494 INFO L591 BuchiCegarLoop]: Abstraction has 429 states and 478 transitions. [2019-11-15 21:34:02,494 INFO L424 BuchiCegarLoop]: ======== Iteration 21============ [2019-11-15 21:34:02,495 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 429 states and 478 transitions. [2019-11-15 21:34:02,496 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2019-11-15 21:34:02,496 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:34:02,496 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:34:02,498 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:02,498 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:02,498 INFO L791 eck$LassoCheckResult]: Stem: 29060#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 29037#L40 assume !(0 == mp_add_~a3~0 % 256); 29038#L40-1 mp_add_~nb~0 := 4; 29055#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 29056#L52 assume !(0 == mp_add_~b2~0 % 256); 29044#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 29070#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29071#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29066#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 29067#L65-2 assume !(1 == mp_add_~i~0 % 256); 29186#L66-1 assume !(2 == mp_add_~i~0 % 256); 29187#L67-1 assume !(3 == mp_add_~i~0 % 256); 29177#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29179#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29171#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 29172#L80-1 assume !(1 == mp_add_~i~0 % 256); 29167#L81-1 assume !(2 == mp_add_~i~0 % 256); 29168#L82-1 assume !(3 == mp_add_~i~0 % 256); 29108#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29109#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29100#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29101#L65 assume !(0 == mp_add_~i~0 % 256); 29096#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 29097#L66-1 assume !(2 == mp_add_~i~0 % 256); 29092#L67-1 assume !(3 == mp_add_~i~0 % 256); 29093#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29274#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 29272#L76-1 assume !(0 == mp_add_~i~0 % 256); 29270#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 29268#L81-1 assume !(2 == mp_add_~i~0 % 256); 29266#L82-1 assume !(3 == mp_add_~i~0 % 256); 29264#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29262#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29259#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29256#L65 assume !(0 == mp_add_~i~0 % 256); 29253#L65-2 assume !(1 == mp_add_~i~0 % 256); 29250#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 29247#L67-1 assume !(3 == mp_add_~i~0 % 256); 29237#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29233#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 29231#L76-1 assume !(0 == mp_add_~i~0 % 256); 29229#L80-1 assume !(1 == mp_add_~i~0 % 256); 29227#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 29225#L82-1 assume !(3 == mp_add_~i~0 % 256); 29223#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29221#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29219#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29217#L65 assume !(0 == mp_add_~i~0 % 256); 29215#L65-2 assume !(1 == mp_add_~i~0 % 256); 29213#L66-1 assume !(2 == mp_add_~i~0 % 256); 29211#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 29205#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29202#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 29203#L76-1 assume !(0 == mp_add_~i~0 % 256); 29375#L80-1 assume !(1 == mp_add_~i~0 % 256); 29198#L81-1 assume !(2 == mp_add_~i~0 % 256); 29195#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 29196#L83-1 [2019-11-15 21:34:02,498 INFO L793 eck$LassoCheckResult]: Loop: 29196#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 29376#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 29072#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 29045#L65 assume !(0 == mp_add_~i~0 % 256); 29046#L65-2 assume !(1 == mp_add_~i~0 % 256); 29373#L66-1 assume !(2 == mp_add_~i~0 % 256); 29349#L67-1 assume !(3 == mp_add_~i~0 % 256); 29324#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 29325#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 29397#L76-1 assume !(0 == mp_add_~i~0 % 256); 29396#L80-1 assume !(1 == mp_add_~i~0 % 256); 29395#L81-1 assume !(2 == mp_add_~i~0 % 256); 29394#L82-1 assume !(3 == mp_add_~i~0 % 256); 29196#L83-1 [2019-11-15 21:34:02,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:02,499 INFO L82 PathProgramCache]: Analyzing trace with hash 418814049, now seen corresponding path program 1 times [2019-11-15 21:34:02,499 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:02,499 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346449107] [2019-11-15 21:34:02,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:02,499 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:02,500 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:02,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:02,630 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-15 21:34:02,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346449107] [2019-11-15 21:34:02,631 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:02,631 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-15 21:34:02,631 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754759176] [2019-11-15 21:34:02,632 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:34:02,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:02,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1978172715, now seen corresponding path program 2 times [2019-11-15 21:34:02,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:02,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261130017] [2019-11-15 21:34:02,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:02,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:02,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:02,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:02,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:02,642 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:34:02,754 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:02,754 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:02,754 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:02,754 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:02,754 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:34:02,754 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:02,754 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:02,754 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:02,755 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration21_Loop [2019-11-15 21:34:02,755 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:02,755 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:02,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:02,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:03,025 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:03,101 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:03,102 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:34:03,117 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:34:03,118 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:03,130 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 21:34:03,130 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Honda state: {ULTIMATE.start_mp_add_~partial_sum~0=0, ULTIMATE.start_mp_add_~carry~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:34:03,150 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:34:03,150 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:34:03,203 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:34:03,203 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:04,419 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:34:04,422 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:04,423 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:04,423 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:04,423 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:04,423 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:34:04,423 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:04,423 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:04,423 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:04,423 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration21_Loop [2019-11-15 21:34:04,423 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:04,423 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:04,424 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:04,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:04,636 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:04,745 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:04,745 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:34:04,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-11-15 21:34:04,746 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:04,746 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,747 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,747 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,747 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:04,747 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:04,747 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,750 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,751 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,751 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:04,751 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,751 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,752 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,752 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:04,753 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:04,753 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,754 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,754 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:34:04,754 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,755 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:04,756 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,756 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,756 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,756 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:04,757 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:04,757 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,761 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,762 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,763 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:04,763 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,764 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:04,764 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:04,765 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,765 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,766 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 21:34:04,766 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:04,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,768 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,768 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:04,769 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:04,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,775 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,775 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,776 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:04,776 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,776 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,776 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,776 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:04,777 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:04,777 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,778 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,778 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 21:34:04,783 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,783 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:04,783 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,784 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,784 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,784 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:04,785 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:04,785 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,792 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,792 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,793 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:04,793 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,793 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,794 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,794 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:04,794 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:04,795 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,795 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,796 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 21:34:04,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,796 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:04,797 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:04,797 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,798 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:04,799 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:04,799 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,814 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,815 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:04,815 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:04,815 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,816 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,816 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:04,816 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:04,816 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,818 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,818 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 21:34:04,818 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,819 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:04,819 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:04,819 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,819 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,819 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:04,821 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:04,821 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,855 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:04,855 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:04,855 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,856 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:04,858 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:04,858 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,861 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 21:34:04,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,862 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:04,862 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:04,862 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,862 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,863 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:04,865 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:04,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,880 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,881 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:04,925 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:04,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,925 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,925 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:04,927 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:04,927 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,929 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,929 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 21:34:04,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,929 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:04,929 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:04,930 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,930 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,930 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,930 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:04,931 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:04,931 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,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-11-15 21:34:04,953 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:04,953 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:04,953 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,953 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,953 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,953 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:04,954 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:04,954 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:04,960 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:04,961 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 21:34:04,963 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:04,964 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:04,964 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:04,965 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:04,965 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:04,965 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:04,965 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:04,967 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:04,967 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:05,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:05,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-11-15 21:34:05,006 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:05,006 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:05,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:05,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:05,007 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:05,007 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:05,008 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:05,008 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:05,014 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:05,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:05,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-15 21:34:05,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-11-15 21:34:05,015 INFO L87 Difference]: Start difference. First operand 429 states and 478 transitions. cyclomatic complexity: 52 Second operand 7 states. [2019-11-15 21:34:05,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:05,610 INFO L93 Difference]: Finished difference Result 690 states and 758 transitions. [2019-11-15 21:34:05,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-15 21:34:05,611 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 690 states and 758 transitions. [2019-11-15 21:34:05,614 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 75 [2019-11-15 21:34:05,617 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 690 states to 600 states and 658 transitions. [2019-11-15 21:34:05,617 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 600 [2019-11-15 21:34:05,618 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 600 [2019-11-15 21:34:05,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 600 states and 658 transitions. [2019-11-15 21:34:05,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:34:05,619 INFO L688 BuchiCegarLoop]: Abstraction has 600 states and 658 transitions. [2019-11-15 21:34:05,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states and 658 transitions. [2019-11-15 21:34:05,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 476. [2019-11-15 21:34:05,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 476 states. [2019-11-15 21:34:05,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 527 transitions. [2019-11-15 21:34:05,628 INFO L711 BuchiCegarLoop]: Abstraction has 476 states and 527 transitions. [2019-11-15 21:34:05,628 INFO L591 BuchiCegarLoop]: Abstraction has 476 states and 527 transitions. [2019-11-15 21:34:05,628 INFO L424 BuchiCegarLoop]: ======== Iteration 22============ [2019-11-15 21:34:05,629 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 476 states and 527 transitions. [2019-11-15 21:34:05,630 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2019-11-15 21:34:05,632 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:34:05,632 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:34:05,633 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:05,633 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:05,633 INFO L791 eck$LassoCheckResult]: Stem: 30196#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 30173#L40 assume !(0 == mp_add_~a3~0 % 256); 30174#L40-1 mp_add_~nb~0 := 4; 30191#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 30192#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 30198#L54 assume !(0 == mp_add_~b1~0 % 256); 30264#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 30263#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30262#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30261#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 30260#L65-2 assume !(1 == mp_add_~i~0 % 256); 30259#L66-1 assume !(2 == mp_add_~i~0 % 256); 30258#L67-1 assume !(3 == mp_add_~i~0 % 256); 30256#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30247#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 30449#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 30448#L80-1 assume !(1 == mp_add_~i~0 % 256); 30447#L81-1 assume !(2 == mp_add_~i~0 % 256); 30446#L82-1 assume !(3 == mp_add_~i~0 % 256); 30445#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30444#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30443#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30442#L65 assume !(0 == mp_add_~i~0 % 256); 30441#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 30440#L66-1 assume !(2 == mp_add_~i~0 % 256); 30438#L67-1 assume !(3 == mp_add_~i~0 % 256); 30435#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30433#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 30431#L76-1 assume !(0 == mp_add_~i~0 % 256); 30429#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 30427#L81-1 assume !(2 == mp_add_~i~0 % 256); 30425#L82-1 assume !(3 == mp_add_~i~0 % 256); 30423#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30421#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30419#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30417#L65 assume !(0 == mp_add_~i~0 % 256); 30415#L65-2 assume !(1 == mp_add_~i~0 % 256); 30413#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 30410#L67-1 assume !(3 == mp_add_~i~0 % 256); 30406#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30357#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 30358#L76-1 assume !(0 == mp_add_~i~0 % 256); 30623#L80-1 assume !(1 == mp_add_~i~0 % 256); 30622#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 30621#L82-1 assume !(3 == mp_add_~i~0 % 256); 30620#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30619#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30618#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30617#L65 assume !(0 == mp_add_~i~0 % 256); 30616#L65-2 assume !(1 == mp_add_~i~0 % 256); 30615#L66-1 assume !(2 == mp_add_~i~0 % 256); 30614#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 30194#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30172#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 30178#L76-1 assume !(0 == mp_add_~i~0 % 256); 30179#L80-1 assume !(1 == mp_add_~i~0 % 256); 30626#L81-1 assume !(2 == mp_add_~i~0 % 256); 30625#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 30167#L83-1 [2019-11-15 21:34:05,633 INFO L793 eck$LassoCheckResult]: Loop: 30167#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 30185#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 30186#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 30182#L65 assume !(0 == mp_add_~i~0 % 256); 30176#L65-2 assume !(1 == mp_add_~i~0 % 256); 30177#L66-1 assume !(2 == mp_add_~i~0 % 256); 30183#L67-1 assume !(3 == mp_add_~i~0 % 256); 30184#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 30187#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 30188#L76-1 assume !(0 == mp_add_~i~0 % 256); 30162#L80-1 assume !(1 == mp_add_~i~0 % 256); 30163#L81-1 assume !(2 == mp_add_~i~0 % 256); 30166#L82-1 assume !(3 == mp_add_~i~0 % 256); 30167#L83-1 [2019-11-15 21:34:05,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:05,634 INFO L82 PathProgramCache]: Analyzing trace with hash -846394610, now seen corresponding path program 1 times [2019-11-15 21:34:05,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:05,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620404040] [2019-11-15 21:34:05,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:05,635 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:05,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:05,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:05,759 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-15 21:34:05,760 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620404040] [2019-11-15 21:34:05,760 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:05,760 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 21:34:05,761 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560404431] [2019-11-15 21:34:05,762 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:34:05,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:05,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1978172715, now seen corresponding path program 3 times [2019-11-15 21:34:05,762 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:05,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958661798] [2019-11-15 21:34:05,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:05,763 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:05,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:05,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:05,772 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:34:05,864 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:05,864 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:05,864 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:05,864 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:05,864 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:34:05,864 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:05,864 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:05,864 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:05,865 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration22_Loop [2019-11-15 21:34:05,865 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:05,865 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:05,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:05,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:06,080 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:06,175 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:06,175 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:06,180 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:34:06,180 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:06,238 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:34:06,238 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:34:07,517 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:34:07,520 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:07,520 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:07,520 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:07,521 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:07,521 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:34:07,521 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:07,521 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:07,521 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:07,521 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration22_Loop [2019-11-15 21:34:07,521 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:07,521 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:07,522 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:07,547 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:07,722 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:07,829 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:07,829 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:34:07,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:07,830 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,830 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:07,831 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:07,831 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,840 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:07,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,841 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:07,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:07,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,844 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:34:07,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,845 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:07,846 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,846 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:07,847 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:07,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,852 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,852 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:07,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,853 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,853 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,854 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:07,854 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:07,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,855 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 21:34:07,856 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:07,857 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,857 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,857 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,857 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:07,867 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:07,877 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,883 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,883 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,884 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:07,884 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,884 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,885 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,885 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:07,886 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:07,886 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,887 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 21:34:07,888 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,888 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:07,888 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,889 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,889 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:07,890 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:07,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,897 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:07,898 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,898 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,899 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:07,899 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:07,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,901 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 21:34:07,902 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,902 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:07,902 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:07,903 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,903 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,903 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,903 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:07,904 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:07,905 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,912 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:07,912 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:07,912 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,913 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,913 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,913 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:07,914 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:07,914 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,915 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,915 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 21:34:07,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-11-15 21:34:07,916 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:07,916 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:07,917 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,917 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,917 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,917 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:07,924 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:07,924 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,941 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,942 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:07,942 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:07,943 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,943 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:07,945 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:07,945 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,947 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,947 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 21:34:07,948 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,948 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:07,948 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:07,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,949 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:07,952 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:07,952 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,967 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:07,968 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:07,968 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,968 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:07,970 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:07,970 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:07,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:07,972 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 21:34:07,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:07,974 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:07,974 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:07,974 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:07,975 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:07,975 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:07,975 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:07,988 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:07,988 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:08,000 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:08,000 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:08,001 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:08,001 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:08,001 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:08,002 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:08,002 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:08,002 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:08,003 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:08,003 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:08,007 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:08,007 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 21:34:08,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:08,009 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:08,009 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:08,009 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:08,009 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:08,009 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:08,009 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:08,011 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:08,012 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:08,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:08,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:08,052 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:08,052 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:08,053 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:08,053 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:08,053 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:08,053 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:08,054 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:08,054 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:08,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:08,060 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:08,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-15 21:34:08,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-11-15 21:34:08,061 INFO L87 Difference]: Start difference. First operand 476 states and 527 transitions. cyclomatic complexity: 54 Second operand 8 states. [2019-11-15 21:34:09,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:09,115 INFO L93 Difference]: Finished difference Result 751 states and 820 transitions. [2019-11-15 21:34:09,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-15 21:34:09,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 751 states and 820 transitions. [2019-11-15 21:34:09,118 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 88 [2019-11-15 21:34:09,122 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 751 states to 673 states and 734 transitions. [2019-11-15 21:34:09,122 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 673 [2019-11-15 21:34:09,123 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 673 [2019-11-15 21:34:09,123 INFO L73 IsDeterministic]: Start isDeterministic. Operand 673 states and 734 transitions. [2019-11-15 21:34:09,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:34:09,124 INFO L688 BuchiCegarLoop]: Abstraction has 673 states and 734 transitions. [2019-11-15 21:34:09,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states and 734 transitions. [2019-11-15 21:34:09,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 518. [2019-11-15 21:34:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 518 states. [2019-11-15 21:34:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 518 states to 518 states and 570 transitions. [2019-11-15 21:34:09,134 INFO L711 BuchiCegarLoop]: Abstraction has 518 states and 570 transitions. [2019-11-15 21:34:09,135 INFO L591 BuchiCegarLoop]: Abstraction has 518 states and 570 transitions. [2019-11-15 21:34:09,135 INFO L424 BuchiCegarLoop]: ======== Iteration 23============ [2019-11-15 21:34:09,135 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 518 states and 570 transitions. [2019-11-15 21:34:09,137 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 43 [2019-11-15 21:34:09,137 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:34:09,137 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:34:09,142 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:09,142 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:09,149 INFO L791 eck$LassoCheckResult]: Stem: 31445#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 31423#L40 assume !(0 == mp_add_~a3~0 % 256); 31419#L40-1 mp_add_~nb~0 := 4; 31420#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 31440#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 31452#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 31453#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 31518#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31517#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31516#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 31515#L65-2 assume !(1 == mp_add_~i~0 % 256); 31514#L66-1 assume !(2 == mp_add_~i~0 % 256); 31513#L67-1 assume !(3 == mp_add_~i~0 % 256); 31511#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31498#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31635#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 31634#L80-1 assume !(1 == mp_add_~i~0 % 256); 31633#L81-1 assume !(2 == mp_add_~i~0 % 256); 31632#L82-1 assume !(3 == mp_add_~i~0 % 256); 31631#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31630#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31629#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31628#L65 assume !(0 == mp_add_~i~0 % 256); 31627#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 31626#L66-1 assume !(2 == mp_add_~i~0 % 256); 31624#L67-1 assume !(3 == mp_add_~i~0 % 256); 31621#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31618#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31619#L76-1 assume !(0 == mp_add_~i~0 % 256); 31888#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 31887#L81-1 assume !(2 == mp_add_~i~0 % 256); 31885#L82-1 assume !(3 == mp_add_~i~0 % 256); 31882#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31880#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31876#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31875#L65 assume !(0 == mp_add_~i~0 % 256); 31874#L65-2 assume !(1 == mp_add_~i~0 % 256); 31873#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 31871#L67-1 assume !(3 == mp_add_~i~0 % 256); 31868#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31847#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31848#L76-1 assume !(0 == mp_add_~i~0 % 256); 31900#L80-1 assume !(1 == mp_add_~i~0 % 256); 31899#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 31898#L82-1 assume !(3 == mp_add_~i~0 % 256); 31897#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31896#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31895#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31894#L65 assume !(0 == mp_add_~i~0 % 256); 31893#L65-2 assume !(1 == mp_add_~i~0 % 256); 31892#L66-1 assume !(2 == mp_add_~i~0 % 256); 31891#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 31442#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31422#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 31427#L76-1 assume !(0 == mp_add_~i~0 % 256); 31428#L80-1 assume !(1 == mp_add_~i~0 % 256); 31916#L81-1 assume !(2 == mp_add_~i~0 % 256); 31915#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 31417#L83-1 [2019-11-15 21:34:09,150 INFO L793 eck$LassoCheckResult]: Loop: 31417#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 31434#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 31435#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 31431#L65 assume !(0 == mp_add_~i~0 % 256); 31425#L65-2 assume !(1 == mp_add_~i~0 % 256); 31426#L66-1 assume !(2 == mp_add_~i~0 % 256); 31432#L67-1 assume !(3 == mp_add_~i~0 % 256); 31433#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 31929#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 31928#L76-1 assume !(0 == mp_add_~i~0 % 256); 31412#L80-1 assume !(1 == mp_add_~i~0 % 256); 31413#L81-1 assume !(2 == mp_add_~i~0 % 256); 31416#L82-1 assume !(3 == mp_add_~i~0 % 256); 31417#L83-1 [2019-11-15 21:34:09,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:09,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1290295284, now seen corresponding path program 1 times [2019-11-15 21:34:09,150 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:09,150 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1727041269] [2019-11-15 21:34:09,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:09,151 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:09,151 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:09,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:09,315 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2019-11-15 21:34:09,315 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1727041269] [2019-11-15 21:34:09,316 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 21:34:09,316 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-11-15 21:34:09,316 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755328845] [2019-11-15 21:34:09,316 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:34:09,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:09,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1978172715, now seen corresponding path program 4 times [2019-11-15 21:34:09,317 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:09,317 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1678782095] [2019-11-15 21:34:09,317 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:09,318 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:09,318 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:09,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:09,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:09,325 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:34:09,444 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:09,444 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:09,445 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:09,445 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:09,445 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:34:09,445 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:09,445 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:09,445 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:09,445 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration23_Loop [2019-11-15 21:34:09,445 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:09,445 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:09,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:09,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:09,623 WARN L191 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:09,739 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:09,739 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:09,795 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:34:09,795 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:34:09,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:34:09,870 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:11,049 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:34:11,059 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:11,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:11,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:11,059 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:11,059 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:34:11,059 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:11,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:11,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:11,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration23_Loop [2019-11-15 21:34:11,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:11,060 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:11,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:11,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:11,234 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:11,327 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:11,327 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:34:11,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-11-15 21:34:11,328 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:11,328 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,328 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,328 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,328 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:11,329 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:11,329 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,331 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,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-11-15 21:34:11,332 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:11,333 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,333 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,333 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,333 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:11,334 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:11,334 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,335 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:34:11,335 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,336 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:11,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,336 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,336 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,336 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:11,337 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:11,337 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,341 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,341 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,342 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:11,342 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,342 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,342 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,343 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:11,343 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:11,343 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,344 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 21:34:11,345 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:11,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,346 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,346 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:11,347 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:11,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,352 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,353 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:11,353 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,353 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,354 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:11,354 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:11,354 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,356 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 21:34:11,356 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,357 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:11,357 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,357 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,357 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,357 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:11,358 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:11,358 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,365 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,365 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:11,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,366 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:11,367 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:11,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,368 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 21:34:11,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,369 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:11,369 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:11,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,370 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:11,371 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:11,371 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,377 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,378 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,378 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:11,378 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:11,379 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,379 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,379 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,379 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:11,380 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:11,380 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,381 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 21:34:11,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,382 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:11,382 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:11,382 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,383 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,383 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,383 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:11,385 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:11,385 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,403 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:11,403 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:11,403 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,403 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,403 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,404 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:11,405 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:11,405 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,407 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 21:34:11,407 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,408 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:11,408 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:11,408 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,408 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,409 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:11,412 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:11,412 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,425 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,426 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:11,426 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:11,426 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,426 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,426 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,427 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:11,428 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:11,428 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,430 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 21:34:11,430 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,430 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:11,431 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:11,431 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,431 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,431 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,431 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:11,432 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:11,432 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,441 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,442 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:11,442 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:11,442 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,442 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:11,443 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:11,443 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,446 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 21:34:11,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,447 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:11,447 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:11,447 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,448 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:11,449 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:11,450 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:11,468 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:11,468 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:11,468 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:11,468 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:11,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:11,469 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:11,470 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:11,470 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:11,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:11,475 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:11,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 21:34:11,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-15 21:34:11,476 INFO L87 Difference]: Start difference. First operand 518 states and 570 transitions. cyclomatic complexity: 55 Second operand 9 states. [2019-11-15 21:34:12,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:12,556 INFO L93 Difference]: Finished difference Result 399 states and 426 transitions. [2019-11-15 21:34:12,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-15 21:34:12,556 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 426 transitions. [2019-11-15 21:34:12,558 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 52 [2019-11-15 21:34:12,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 350 states and 374 transitions. [2019-11-15 21:34:12,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 350 [2019-11-15 21:34:12,560 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 350 [2019-11-15 21:34:12,560 INFO L73 IsDeterministic]: Start isDeterministic. Operand 350 states and 374 transitions. [2019-11-15 21:34:12,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:34:12,561 INFO L688 BuchiCegarLoop]: Abstraction has 350 states and 374 transitions. [2019-11-15 21:34:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states and 374 transitions. [2019-11-15 21:34:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 217. [2019-11-15 21:34:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-15 21:34:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 232 transitions. [2019-11-15 21:34:12,566 INFO L711 BuchiCegarLoop]: Abstraction has 217 states and 232 transitions. [2019-11-15 21:34:12,566 INFO L591 BuchiCegarLoop]: Abstraction has 217 states and 232 transitions. [2019-11-15 21:34:12,566 INFO L424 BuchiCegarLoop]: ======== Iteration 24============ [2019-11-15 21:34:12,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 232 transitions. [2019-11-15 21:34:12,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-15 21:34:12,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:34:12,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:34:12,567 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:12,568 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:12,568 INFO L791 eck$LassoCheckResult]: Stem: 32383#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 32361#L40 assume !(0 == mp_add_~a3~0 % 256); 32362#L40-1 mp_add_~nb~0 := 4; 32379#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 32380#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 32367#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 32368#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 32376#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32419#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32418#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 32417#L65-2 assume !(1 == mp_add_~i~0 % 256); 32416#L66-1 assume !(2 == mp_add_~i~0 % 256); 32415#L67-1 assume !(3 == mp_add_~i~0 % 256); 32414#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 32413#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 32351#L71-2 assume !(1 == mp_add_~i~0 % 256); 32352#L72-1 assume !(2 == mp_add_~i~0 % 256); 32532#L73-1 assume !(3 == mp_add_~i~0 % 256); 32531#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32530#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 32529#L80-1 assume !(1 == mp_add_~i~0 % 256); 32528#L81-1 assume !(2 == mp_add_~i~0 % 256); 32527#L82-1 assume !(3 == mp_add_~i~0 % 256); 32526#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32525#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32524#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32523#L65 assume !(0 == mp_add_~i~0 % 256); 32521#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 32522#L66-1 assume !(2 == mp_add_~i~0 % 256); 32547#L67-1 assume !(3 == mp_add_~i~0 % 256); 32546#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32544#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32543#L76-1 assume !(0 == mp_add_~i~0 % 256); 32542#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 32541#L81-1 assume !(2 == mp_add_~i~0 % 256); 32540#L82-1 assume !(3 == mp_add_~i~0 % 256); 32539#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32538#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32537#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32536#L65 assume !(0 == mp_add_~i~0 % 256); 32535#L65-2 assume !(1 == mp_add_~i~0 % 256); 32533#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 32534#L67-1 assume !(3 == mp_add_~i~0 % 256); 32565#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32360#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32564#L76-1 assume !(0 == mp_add_~i~0 % 256); 32563#L80-1 assume !(1 == mp_add_~i~0 % 256); 32562#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 32561#L82-1 assume !(3 == mp_add_~i~0 % 256); 32560#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32559#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32558#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32557#L65 assume !(0 == mp_add_~i~0 % 256); 32556#L65-2 assume !(1 == mp_add_~i~0 % 256); 32555#L66-1 assume !(2 == mp_add_~i~0 % 256); 32554#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 32553#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32552#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 32551#L76-1 assume !(0 == mp_add_~i~0 % 256); 32550#L80-1 assume !(1 == mp_add_~i~0 % 256); 32549#L81-1 assume !(2 == mp_add_~i~0 % 256); 32548#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 32354#L83-1 [2019-11-15 21:34:12,569 INFO L793 eck$LassoCheckResult]: Loop: 32354#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 32373#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 32374#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 32370#L65 assume !(0 == mp_add_~i~0 % 256); 32364#L65-2 assume !(1 == mp_add_~i~0 % 256); 32365#L66-1 assume !(2 == mp_add_~i~0 % 256); 32371#L67-1 assume !(3 == mp_add_~i~0 % 256); 32372#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 32375#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 32366#L76-1 assume !(0 == mp_add_~i~0 % 256); 32349#L80-1 assume !(1 == mp_add_~i~0 % 256); 32350#L81-1 assume !(2 == mp_add_~i~0 % 256); 32353#L82-1 assume !(3 == mp_add_~i~0 % 256); 32354#L83-1 [2019-11-15 21:34:12,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:12,570 INFO L82 PathProgramCache]: Analyzing trace with hash 26851712, now seen corresponding path program 1 times [2019-11-15 21:34:12,570 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:12,570 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063249790] [2019-11-15 21:34:12,570 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:12,571 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:12,571 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:12,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:12,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:12,649 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:34:12,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:12,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1978172715, now seen corresponding path program 5 times [2019-11-15 21:34:12,650 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:12,650 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467882912] [2019-11-15 21:34:12,650 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:12,651 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:12,651 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:12,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:12,657 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:34:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:12,657 INFO L82 PathProgramCache]: Analyzing trace with hash -391482868, now seen corresponding path program 1 times [2019-11-15 21:34:12,657 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:12,658 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240220969] [2019-11-15 21:34:12,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:12,658 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:12,658 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:12,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:12,921 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 24 proven. 24 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2019-11-15 21:34:12,921 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240220969] [2019-11-15 21:34:12,922 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463086502] [2019-11-15 21:34:12,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:34:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:13,009 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 7 conjunts are in the unsatisfiable core [2019-11-15 21:34:13,011 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:34:13,119 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-15 21:34:13,120 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-15 21:34:13,120 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 11 [2019-11-15 21:34:13,120 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532183209] [2019-11-15 21:34:13,242 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:13,242 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:13,242 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:13,242 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:13,242 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:34:13,242 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:13,242 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:13,243 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:13,243 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration24_Loop [2019-11-15 21:34:13,243 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:13,243 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:13,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:13,268 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:13,519 WARN L191 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:13,629 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:13,629 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:34:13,646 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:34:13,647 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:34:13,716 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:34:13,716 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:25,745 INFO L442 LassoAnalysis]: Proving nontermination failed: SMT Solver returned 'unknown'. [2019-11-15 21:34:25,748 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:25,748 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:25,748 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:25,748 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:25,748 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:34:25,748 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:25,748 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:25,748 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:25,748 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration24_Loop [2019-11-15 21:34:25,748 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:25,749 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:25,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:25,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:25,947 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:26,028 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:26,029 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:34:26,029 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,029 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:26,029 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,030 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,030 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,030 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:26,030 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:26,030 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,034 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,034 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,035 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:26,035 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,035 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,035 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,035 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:26,035 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:26,035 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,039 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,039 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:34:26,040 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,040 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:26,041 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,041 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,041 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,041 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:26,042 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:26,042 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,046 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,046 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,047 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:26,047 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,048 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,048 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:26,048 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:26,049 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,049 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,050 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 21:34:26,050 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:26,051 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,051 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,051 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:26,052 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:26,052 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,056 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,057 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:26,058 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,058 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:26,059 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:26,059 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,060 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 21:34:26,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-11-15 21:34:26,061 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:26,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,062 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,062 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:26,063 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:26,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,068 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:26,070 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,070 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:26,071 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:26,071 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,072 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 21:34:26,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,073 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:26,073 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:26,073 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,073 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,074 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:26,079 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:26,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,086 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:26,086 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:26,086 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,087 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:26,088 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:26,088 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,089 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 21:34:26,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,090 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:26,090 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:26,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,091 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:26,093 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:26,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,104 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,104 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:26,104 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:26,105 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,105 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,105 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,105 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:26,106 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:26,106 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,108 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,108 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 21:34:26,109 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,109 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:26,109 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:26,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,110 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:26,113 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:26,113 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,137 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:26,137 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:26,137 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,138 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,138 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:26,139 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:26,140 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,141 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,141 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 21:34:26,141 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,143 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:26,143 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:26,143 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,143 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,144 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,144 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:26,145 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:26,145 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,155 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,155 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,156 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:26,156 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:26,156 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,156 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,157 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,157 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:26,157 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:26,158 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,162 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,162 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 21:34:26,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,163 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:26,163 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:26,163 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,164 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,164 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:26,165 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:26,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,270 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,276 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:26,277 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:26,277 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:26,278 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:26,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:26,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:26,278 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:26,279 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:26,279 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:26,285 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:26,285 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:26,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 21:34:26,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2019-11-15 21:34:26,286 INFO L87 Difference]: Start difference. First operand 217 states and 232 transitions. cyclomatic complexity: 16 Second operand 5 states. [2019-11-15 21:34:26,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:26,415 INFO L93 Difference]: Finished difference Result 353 states and 376 transitions. [2019-11-15 21:34:26,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 21:34:26,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 353 states and 376 transitions. [2019-11-15 21:34:26,417 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-15 21:34:26,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 353 states to 215 states and 229 transitions. [2019-11-15 21:34:26,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 215 [2019-11-15 21:34:26,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 215 [2019-11-15 21:34:26,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 215 states and 229 transitions. [2019-11-15 21:34:26,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:34:26,419 INFO L688 BuchiCegarLoop]: Abstraction has 215 states and 229 transitions. [2019-11-15 21:34:26,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states and 229 transitions. [2019-11-15 21:34:26,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2019-11-15 21:34:26,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2019-11-15 21:34:26,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 229 transitions. [2019-11-15 21:34:26,422 INFO L711 BuchiCegarLoop]: Abstraction has 215 states and 229 transitions. [2019-11-15 21:34:26,422 INFO L591 BuchiCegarLoop]: Abstraction has 215 states and 229 transitions. [2019-11-15 21:34:26,422 INFO L424 BuchiCegarLoop]: ======== Iteration 25============ [2019-11-15 21:34:26,422 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 215 states and 229 transitions. [2019-11-15 21:34:26,423 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-15 21:34:26,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:34:26,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:34:26,424 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:26,427 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:26,427 INFO L791 eck$LassoCheckResult]: Stem: 33190#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 33167#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 33168#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 33189#L44 assume !(0 == mp_add_~a1~0 % 256); 33164#L40-1 mp_add_~nb~0 := 4; 33165#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 33187#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 33174#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 33175#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 33183#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33318#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33316#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 33314#L65-2 assume !(1 == mp_add_~i~0 % 256); 33312#L66-1 assume !(2 == mp_add_~i~0 % 256); 33310#L67-1 assume !(3 == mp_add_~i~0 % 256); 33221#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 33166#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 33160#L71-2 assume !(1 == mp_add_~i~0 % 256); 33161#L72-1 assume !(2 == mp_add_~i~0 % 256); 33169#L73-1 assume !(3 == mp_add_~i~0 % 256); 33170#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 33364#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 33362#L80-1 assume !(1 == mp_add_~i~0 % 256); 33360#L81-1 assume !(2 == mp_add_~i~0 % 256); 33358#L82-1 assume !(3 == mp_add_~i~0 % 256); 33356#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33354#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33352#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33349#L65 assume !(0 == mp_add_~i~0 % 256); 33346#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 33325#L66-1 assume !(2 == mp_add_~i~0 % 256); 33323#L67-1 assume !(3 == mp_add_~i~0 % 256); 33321#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33319#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 33309#L76-1 assume !(0 == mp_add_~i~0 % 256); 33307#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 33305#L81-1 assume !(2 == mp_add_~i~0 % 256); 33303#L82-1 assume !(3 == mp_add_~i~0 % 256); 33301#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33299#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33270#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33267#L65 assume !(0 == mp_add_~i~0 % 256); 33264#L65-2 assume !(1 == mp_add_~i~0 % 256); 33261#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 33258#L67-1 assume !(3 == mp_add_~i~0 % 256); 33255#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33252#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 33250#L76-1 assume !(0 == mp_add_~i~0 % 256); 33248#L80-1 assume !(1 == mp_add_~i~0 % 256); 33246#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 33244#L82-1 assume !(3 == mp_add_~i~0 % 256); 33242#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33240#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33238#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33236#L65 assume !(0 == mp_add_~i~0 % 256); 33234#L65-2 assume !(1 == mp_add_~i~0 % 256); 33232#L66-1 assume !(2 == mp_add_~i~0 % 256); 33230#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 33228#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33226#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 33225#L76-1 assume !(0 == mp_add_~i~0 % 256); 33224#L80-1 assume !(1 == mp_add_~i~0 % 256); 33223#L81-1 assume !(2 == mp_add_~i~0 % 256); 33222#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 33163#L83-1 [2019-11-15 21:34:26,427 INFO L793 eck$LassoCheckResult]: Loop: 33163#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33180#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33181#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33177#L65 assume !(0 == mp_add_~i~0 % 256); 33171#L65-2 assume !(1 == mp_add_~i~0 % 256); 33172#L66-1 assume !(2 == mp_add_~i~0 % 256); 33178#L67-1 assume !(3 == mp_add_~i~0 % 256); 33179#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33182#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 33173#L76-1 assume !(0 == mp_add_~i~0 % 256); 33158#L80-1 assume !(1 == mp_add_~i~0 % 256); 33159#L81-1 assume !(2 == mp_add_~i~0 % 256); 33162#L82-1 assume !(3 == mp_add_~i~0 % 256); 33163#L83-1 [2019-11-15 21:34:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:26,428 INFO L82 PathProgramCache]: Analyzing trace with hash -1021469481, now seen corresponding path program 1 times [2019-11-15 21:34:26,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:26,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412924196] [2019-11-15 21:34:26,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:26,428 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:26,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:26,536 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 42 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 21:34:26,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412924196] [2019-11-15 21:34:26,537 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [19739413] [2019-11-15 21:34:26,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:34:26,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:26,631 INFO L256 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-15 21:34:26,632 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:34:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 52 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-11-15 21:34:26,749 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:34:26,750 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7] total 11 [2019-11-15 21:34:26,750 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794836908] [2019-11-15 21:34:26,750 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:34:26,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:26,751 INFO L82 PathProgramCache]: Analyzing trace with hash 1978172715, now seen corresponding path program 6 times [2019-11-15 21:34:26,751 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:26,751 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461811280] [2019-11-15 21:34:26,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:26,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:26,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:26,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:26,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:26,759 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:34:26,857 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:26,857 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:26,857 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:26,857 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:26,858 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:34:26,858 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:26,858 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:26,858 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:26,858 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration25_Loop [2019-11-15 21:34:26,858 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:26,858 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:26,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:26,878 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:27,008 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:27,116 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:27,116 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:34:27,132 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:34:27,132 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:34:27,197 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:34:27,197 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:35,041 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:34:35,044 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:35,044 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:35,044 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:35,044 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:35,044 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:34:35,044 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:35,044 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:35,044 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:35,044 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration25_Loop [2019-11-15 21:34:35,044 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:35,044 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:35,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:35,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:35,233 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:35,233 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:34:35,233 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,233 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:35,234 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,234 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,234 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,234 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:35,234 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:35,234 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,235 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,236 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,236 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:35,236 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,236 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,236 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,236 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:35,237 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:35,237 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,239 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,239 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:34:35,239 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,239 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:35,240 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,240 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,240 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,240 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:35,240 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:35,240 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,241 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,241 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,241 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:35,241 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,242 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,242 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,242 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:35,242 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:35,242 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,245 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,245 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 21:34:35,246 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,246 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:35,246 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,246 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,246 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,246 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:35,247 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:35,247 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,248 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,249 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:35,250 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,250 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,250 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,250 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:35,251 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:35,251 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,255 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,255 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 21:34:35,255 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,256 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:35,256 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,256 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,256 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,256 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:35,257 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:35,257 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,258 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,258 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,259 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:35,259 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,259 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,259 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,259 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:35,260 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:35,260 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,265 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,265 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 21:34:35,265 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,266 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:35,266 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:35,266 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,266 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,267 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:35,267 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:35,268 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,268 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,269 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,269 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:35,269 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:35,270 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,270 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,270 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,270 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:35,271 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:35,271 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,276 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,276 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 21:34:35,277 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,277 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:35,277 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:35,277 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,278 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:35,279 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:35,279 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,281 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,281 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,281 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:35,282 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:35,282 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,282 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,282 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,282 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:35,284 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:35,284 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,293 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,293 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 21:34:35,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-11-15 21:34:35,294 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:35,294 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:35,294 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,294 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,295 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,295 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:35,296 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:35,296 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,297 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,297 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,298 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:35,298 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:35,298 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,298 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,299 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,299 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:35,301 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:35,301 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,318 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,318 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 21:34:35,319 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,319 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:35,319 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:35,320 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,320 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,320 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,320 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:35,321 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:35,321 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,323 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,323 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,324 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:35,324 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:35,324 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,324 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,324 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,325 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:35,325 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:35,326 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,335 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,335 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 21:34:35,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-11-15 21:34:35,336 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:35,336 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:35,336 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,337 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,337 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,337 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:35,338 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:35,338 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,342 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,343 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:35,343 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:35,343 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:35,344 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:35,344 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:35,344 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:35,344 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:35,346 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:35,346 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:35,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:35,365 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:35,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-15 21:34:35,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-11-15 21:34:35,365 INFO L87 Difference]: Start difference. First operand 215 states and 229 transitions. cyclomatic complexity: 15 Second operand 11 states. [2019-11-15 21:34:35,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:35,474 INFO L93 Difference]: Finished difference Result 352 states and 366 transitions. [2019-11-15 21:34:35,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:34:35,475 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 352 states and 366 transitions. [2019-11-15 21:34:35,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-15 21:34:35,478 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 352 states to 352 states and 366 transitions. [2019-11-15 21:34:35,478 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 352 [2019-11-15 21:34:35,478 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 352 [2019-11-15 21:34:35,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 352 states and 366 transitions. [2019-11-15 21:34:35,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:34:35,478 INFO L688 BuchiCegarLoop]: Abstraction has 352 states and 366 transitions. [2019-11-15 21:34:35,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states and 366 transitions. [2019-11-15 21:34:35,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 241. [2019-11-15 21:34:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2019-11-15 21:34:35,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 255 transitions. [2019-11-15 21:34:35,483 INFO L711 BuchiCegarLoop]: Abstraction has 241 states and 255 transitions. [2019-11-15 21:34:35,483 INFO L591 BuchiCegarLoop]: Abstraction has 241 states and 255 transitions. [2019-11-15 21:34:35,483 INFO L424 BuchiCegarLoop]: ======== Iteration 26============ [2019-11-15 21:34:35,483 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 241 states and 255 transitions. [2019-11-15 21:34:35,483 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-15 21:34:35,484 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:34:35,484 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:34:35,485 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:35,485 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:35,485 INFO L791 eck$LassoCheckResult]: Stem: 33960#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 33939#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 33940#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 33959#L44 assume !(0 == mp_add_~a1~0 % 256); 33935#L40-1 mp_add_~nb~0 := 4; 33936#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 33956#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 33944#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 33945#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 33954#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34084#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34083#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34082#L65-2 assume !(1 == mp_add_~i~0 % 256); 34081#L66-1 assume !(2 == mp_add_~i~0 % 256); 34080#L67-1 assume !(3 == mp_add_~i~0 % 256); 34079#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34077#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 34078#L71-2 assume !(1 == mp_add_~i~0 % 256); 34111#L72-1 assume !(2 == mp_add_~i~0 % 256); 34110#L73-1 assume !(3 == mp_add_~i~0 % 256); 34109#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34108#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 34107#L80-1 assume !(1 == mp_add_~i~0 % 256); 34106#L81-1 assume !(2 == mp_add_~i~0 % 256); 34105#L82-1 assume !(3 == mp_add_~i~0 % 256); 34104#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34103#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34102#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34101#L65 assume !(0 == mp_add_~i~0 % 256); 34099#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 34100#L66-1 assume !(2 == mp_add_~i~0 % 256); 34153#L67-1 assume !(3 == mp_add_~i~0 % 256); 34152#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34150#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 34149#L76-1 assume !(0 == mp_add_~i~0 % 256); 34147#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 34145#L81-1 assume !(2 == mp_add_~i~0 % 256); 34143#L82-1 assume !(3 == mp_add_~i~0 % 256); 34141#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34139#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34137#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34135#L65 assume !(0 == mp_add_~i~0 % 256); 34133#L65-2 assume !(1 == mp_add_~i~0 % 256); 34131#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 34129#L67-1 assume !(3 == mp_add_~i~0 % 256); 34127#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34124#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 34122#L76-1 assume !(0 == mp_add_~i~0 % 256); 34121#L80-1 assume !(1 == mp_add_~i~0 % 256); 34120#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 34119#L82-1 assume !(3 == mp_add_~i~0 % 256); 34118#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34117#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34116#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34115#L65 assume !(0 == mp_add_~i~0 % 256); 34114#L65-2 assume !(1 == mp_add_~i~0 % 256); 34113#L66-1 assume !(2 == mp_add_~i~0 % 256); 34112#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 33958#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 33938#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 33953#L76-1 assume !(0 == mp_add_~i~0 % 256); 34156#L80-1 assume !(1 == mp_add_~i~0 % 256); 34155#L81-1 assume !(2 == mp_add_~i~0 % 256); 34154#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 33933#L83-1 [2019-11-15 21:34:35,485 INFO L793 eck$LassoCheckResult]: Loop: 33933#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 33950#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 33951#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 33947#L65 assume !(0 == mp_add_~i~0 % 256); 33941#L65-2 assume !(1 == mp_add_~i~0 % 256); 33942#L66-1 assume !(2 == mp_add_~i~0 % 256); 33948#L67-1 assume !(3 == mp_add_~i~0 % 256); 33949#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34157#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 33943#L76-1 assume !(0 == mp_add_~i~0 % 256); 33928#L80-1 assume !(1 == mp_add_~i~0 % 256); 33929#L81-1 assume !(2 == mp_add_~i~0 % 256); 33932#L82-1 assume !(3 == mp_add_~i~0 % 256); 33933#L83-1 [2019-11-15 21:34:35,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:35,486 INFO L82 PathProgramCache]: Analyzing trace with hash 1980952983, now seen corresponding path program 1 times [2019-11-15 21:34:35,486 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:35,486 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1011185608] [2019-11-15 21:34:35,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:35,486 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:35,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:35,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:35,584 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 49 proven. 11 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-15 21:34:35,584 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1011185608] [2019-11-15 21:34:35,585 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [775556621] [2019-11-15 21:34:35,585 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:34:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:35,653 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 21:34:35,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:34:35,769 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 34 proven. 40 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 21:34:35,769 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:34:35,770 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10] total 10 [2019-11-15 21:34:35,770 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673462128] [2019-11-15 21:34:35,770 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:34:35,770 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:35,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1978172715, now seen corresponding path program 7 times [2019-11-15 21:34:35,771 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:35,771 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068906853] [2019-11-15 21:34:35,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:35,771 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:35,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:35,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:35,776 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:34:35,861 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:35,861 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:35,862 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:35,862 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:35,862 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:34:35,862 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:35,862 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:35,862 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:35,862 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration26_Loop [2019-11-15 21:34:35,862 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:35,862 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:35,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:35,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:36,066 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:36,163 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:36,163 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:34:36,172 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:34:36,172 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 21:34:36,213 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:34:36,213 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:36,921 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:34:36,923 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:36,923 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:36,923 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:36,924 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:36,924 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:34:36,924 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:36,924 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:36,924 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:36,924 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration26_Loop [2019-11-15 21:34:36,924 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:36,924 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:36,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:36,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:37,131 WARN L191 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:37,175 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:37,175 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:34:37,175 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,176 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:37,176 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,176 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,176 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,176 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:37,176 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:37,176 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,177 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:37,178 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,178 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:37,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:37,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,180 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:34:37,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:37,181 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,181 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,181 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:37,182 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:37,182 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,183 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,183 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:37,183 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,183 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,183 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,183 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:37,184 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:37,184 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,188 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,188 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 21:34:37,188 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,188 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:37,189 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,189 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,189 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,189 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:37,190 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:37,190 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,191 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:37,191 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,192 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,192 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:37,192 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:37,192 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,196 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,196 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 21:34:37,197 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,197 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:37,197 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,197 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,198 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:37,198 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:37,198 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,199 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,199 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,200 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:37,200 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,200 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,200 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,200 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:37,201 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:37,201 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,206 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,206 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 21:34:37,206 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,207 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:37,207 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:37,207 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,207 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,207 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,208 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:37,208 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:37,208 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,209 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,209 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,210 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:37,210 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:37,210 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,210 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,210 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,211 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:37,212 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:37,212 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,219 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,219 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 21:34:37,219 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,220 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:37,220 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:37,220 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,220 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,220 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,221 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:37,221 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:37,222 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,223 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,224 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,224 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:37,224 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:37,225 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,225 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,225 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,225 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:37,227 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:37,227 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,242 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,242 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 21:34:37,243 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,243 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:37,243 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:37,244 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,244 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,244 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,244 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:37,246 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:37,246 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,247 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,247 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,248 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:37,248 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:37,248 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,248 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,248 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,248 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:37,251 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:37,251 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,262 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,262 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 21:34:37,262 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,263 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:37,263 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:37,263 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,263 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,263 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,263 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:37,264 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:37,264 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,267 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,267 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:37,267 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:37,267 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,268 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,268 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,268 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:37,269 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:37,269 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,277 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 21:34:37,278 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,278 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:37,278 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:37,278 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,279 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,279 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,279 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:37,280 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:37,280 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,284 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,285 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:37,285 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:37,285 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:37,285 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:37,286 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:37,286 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:37,286 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:37,287 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:37,288 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:37,308 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:37,308 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:37,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-15 21:34:37,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2019-11-15 21:34:37,309 INFO L87 Difference]: Start difference. First operand 241 states and 255 transitions. cyclomatic complexity: 15 Second operand 10 states. [2019-11-15 21:34:37,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:37,423 INFO L93 Difference]: Finished difference Result 354 states and 368 transitions. [2019-11-15 21:34:37,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 21:34:37,424 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 354 states and 368 transitions. [2019-11-15 21:34:37,425 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-15 21:34:37,427 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 354 states to 354 states and 368 transitions. [2019-11-15 21:34:37,427 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 354 [2019-11-15 21:34:37,427 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 354 [2019-11-15 21:34:37,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 354 states and 368 transitions. [2019-11-15 21:34:37,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:34:37,427 INFO L688 BuchiCegarLoop]: Abstraction has 354 states and 368 transitions. [2019-11-15 21:34:37,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states and 368 transitions. [2019-11-15 21:34:37,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 217. [2019-11-15 21:34:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2019-11-15 21:34:37,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 231 transitions. [2019-11-15 21:34:37,431 INFO L711 BuchiCegarLoop]: Abstraction has 217 states and 231 transitions. [2019-11-15 21:34:37,432 INFO L591 BuchiCegarLoop]: Abstraction has 217 states and 231 transitions. [2019-11-15 21:34:37,432 INFO L424 BuchiCegarLoop]: ======== Iteration 27============ [2019-11-15 21:34:37,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 217 states and 231 transitions. [2019-11-15 21:34:37,433 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2019-11-15 21:34:37,433 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 21:34:37,433 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 21:34:37,434 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:37,434 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 21:34:37,434 INFO L791 eck$LassoCheckResult]: Stem: 34758#ULTIMATE.startENTRY havoc main_#res;havoc main_#t~nondet0, main_#t~nondet1, main_#t~ret2, main_~a~0, main_~b~0, main_~r~1;havoc main_~a~0;havoc main_~b~0;havoc main_~r~1;main_~a~0 := main_#t~nondet0;havoc main_#t~nondet0;main_~b~0 := main_#t~nondet1;havoc main_#t~nondet1;mp_add_#in~a, mp_add_#in~b := main_~a~0, main_~b~0;havoc mp_add_#res;havoc mp_add_~a, mp_add_~b, mp_add_~a0~0, mp_add_~a1~0, mp_add_~a2~0, mp_add_~a3~0, mp_add_~b0~0, mp_add_~b1~0, mp_add_~b2~0, mp_add_~b3~0, mp_add_~r0~0, mp_add_~r1~0, mp_add_~r2~0, mp_add_~r3~0, mp_add_~carry~0, mp_add_~partial_sum~0, mp_add_~r~0, mp_add_~i~0, mp_add_~na~0, mp_add_~nb~0;mp_add_~a := mp_add_#in~a;mp_add_~b := mp_add_#in~b;havoc mp_add_~a0~0;havoc mp_add_~a1~0;havoc mp_add_~a2~0;havoc mp_add_~a3~0;havoc mp_add_~b0~0;havoc mp_add_~b1~0;havoc mp_add_~b2~0;havoc mp_add_~b3~0;havoc mp_add_~r0~0;havoc mp_add_~r1~0;havoc mp_add_~r2~0;havoc mp_add_~r3~0;havoc mp_add_~carry~0;havoc mp_add_~partial_sum~0;havoc mp_add_~r~0;havoc mp_add_~i~0;havoc mp_add_~na~0;havoc mp_add_~nb~0;mp_add_~a0~0 := mp_add_~a;mp_add_~a1~0 := mp_add_~a / 256;mp_add_~a2~0 := mp_add_~a / 65536;mp_add_~a3~0 := mp_add_~a / 16777216;mp_add_~b0~0 := mp_add_~b;mp_add_~b1~0 := mp_add_~b / 256;mp_add_~b2~0 := mp_add_~b / 65536;mp_add_~b3~0 := mp_add_~b / 16777216;mp_add_~na~0 := 4; 34734#L40 assume 0 == mp_add_~a3~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 34735#L42 assume 0 == mp_add_~a2~0 % 256;mp_add_~na~0 := mp_add_~na~0 % 256 - 1; 34757#L44 assume !(0 == mp_add_~a1~0 % 256); 34731#L40-1 mp_add_~nb~0 := 4; 34732#L50 assume 0 == mp_add_~b3~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 34754#L52 assume 0 == mp_add_~b2~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 34741#L54 assume 0 == mp_add_~b1~0 % 256;mp_add_~nb~0 := mp_add_~nb~0 % 256 - 1; 34742#L50-1 mp_add_~carry~0 := 0;mp_add_~i~0 := 0; 34751#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34885#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34884#L65 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a0~0 % 256; 34883#L65-2 assume !(1 == mp_add_~i~0 % 256); 34882#L66-1 assume !(2 == mp_add_~i~0 % 256); 34881#L67-1 assume !(3 == mp_add_~i~0 % 256); 34880#L64-1 assume mp_add_~i~0 % 256 < mp_add_~nb~0 % 256; 34878#L71 assume 0 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~b0~0 % 256; 34879#L71-2 assume !(1 == mp_add_~i~0 % 256); 34926#L72-1 assume !(2 == mp_add_~i~0 % 256); 34925#L73-1 assume !(3 == mp_add_~i~0 % 256); 34924#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34923#L76-1 assume 0 == mp_add_~i~0 % 256;mp_add_~r0~0 := mp_add_~partial_sum~0; 34922#L80-1 assume !(1 == mp_add_~i~0 % 256); 34921#L81-1 assume !(2 == mp_add_~i~0 % 256); 34920#L82-1 assume !(3 == mp_add_~i~0 % 256); 34919#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34918#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34917#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34916#L65 assume !(0 == mp_add_~i~0 % 256); 34915#L65-2 assume 1 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a1~0 % 256; 34914#L66-1 assume !(2 == mp_add_~i~0 % 256); 34913#L67-1 assume !(3 == mp_add_~i~0 % 256); 34912#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34910#L70 assume mp_add_~partial_sum~0 % 65536 > 254;mp_add_~partial_sum~0 := ~bitwiseAnd(mp_add_~partial_sum~0 % 65536, 255);mp_add_~carry~0 := 1; 34909#L76-1 assume !(0 == mp_add_~i~0 % 256); 34908#L80-1 assume 1 == mp_add_~i~0 % 256;mp_add_~r1~0 := mp_add_~partial_sum~0; 34907#L81-1 assume !(2 == mp_add_~i~0 % 256); 34906#L82-1 assume !(3 == mp_add_~i~0 % 256); 34905#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34904#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34903#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34902#L65 assume !(0 == mp_add_~i~0 % 256); 34901#L65-2 assume !(1 == mp_add_~i~0 % 256); 34900#L66-1 assume 2 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a2~0 % 256; 34746#L67-1 assume !(3 == mp_add_~i~0 % 256); 34747#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34750#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 34740#L76-1 assume !(0 == mp_add_~i~0 % 256); 34725#L80-1 assume !(1 == mp_add_~i~0 % 256); 34726#L81-1 assume 2 == mp_add_~i~0 % 256;mp_add_~r2~0 := mp_add_~partial_sum~0; 34729#L82-1 assume !(3 == mp_add_~i~0 % 256); 34730#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34935#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34759#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34760#L65 assume !(0 == mp_add_~i~0 % 256); 34738#L65-2 assume !(1 == mp_add_~i~0 % 256); 34739#L66-1 assume !(2 == mp_add_~i~0 % 256); 34934#L67-1 assume 3 == mp_add_~i~0 % 256;mp_add_~partial_sum~0 := mp_add_~partial_sum~0 % 65536 + mp_add_~a3~0 % 256; 34933#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34931#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 34930#L76-1 assume !(0 == mp_add_~i~0 % 256); 34929#L80-1 assume !(1 == mp_add_~i~0 % 256); 34928#L81-1 assume !(2 == mp_add_~i~0 % 256); 34927#L82-1 assume 3 == mp_add_~i~0 % 256;mp_add_~r3~0 := mp_add_~partial_sum~0; 34755#L83-1 [2019-11-15 21:34:37,434 INFO L793 eck$LassoCheckResult]: Loop: 34755#L83-1 mp_add_~i~0 := 1 + mp_add_~i~0 % 256; 34748#L61-2 assume !!((mp_add_~i~0 % 256 < mp_add_~na~0 % 256 || mp_add_~i~0 % 256 < mp_add_~nb~0 % 256) || 0 != mp_add_~carry~0 % 65536);mp_add_~partial_sum~0 := mp_add_~carry~0;mp_add_~carry~0 := 0; 34749#L64 assume mp_add_~i~0 % 256 < mp_add_~na~0 % 256; 34744#L65 assume !(0 == mp_add_~i~0 % 256); 34745#L65-2 assume !(1 == mp_add_~i~0 % 256); 34761#L66-1 assume !(2 == mp_add_~i~0 % 256); 34762#L67-1 assume !(3 == mp_add_~i~0 % 256); 34941#L64-1 assume !(mp_add_~i~0 % 256 < mp_add_~nb~0 % 256); 34940#L70 assume !(mp_add_~partial_sum~0 % 65536 > 254); 34939#L76-1 assume !(0 == mp_add_~i~0 % 256); 34938#L80-1 assume !(1 == mp_add_~i~0 % 256); 34937#L81-1 assume !(2 == mp_add_~i~0 % 256); 34936#L82-1 assume !(3 == mp_add_~i~0 % 256); 34755#L83-1 [2019-11-15 21:34:37,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:37,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1281200151, now seen corresponding path program 2 times [2019-11-15 21:34:37,435 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:37,435 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517709449] [2019-11-15 21:34:37,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:37,435 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:37,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 21:34:37,654 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 48 proven. 15 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-15 21:34:37,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517709449] [2019-11-15 21:34:37,656 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [671917773] [2019-11-15 21:34:37,656 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-15 21:34:37,736 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-15 21:34:37,736 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-15 21:34:37,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 18 conjunts are in the unsatisfiable core [2019-11-15 21:34:37,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 21:34:38,006 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 18 proven. 12 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-11-15 21:34:38,006 INFO L223 tionRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-15 21:34:38,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 17 [2019-11-15 21:34:38,008 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344145078] [2019-11-15 21:34:38,009 INFO L796 eck$LassoCheckResult]: stem already infeasible [2019-11-15 21:34:38,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 21:34:38,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1978172715, now seen corresponding path program 8 times [2019-11-15 21:34:38,009 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 21:34:38,009 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297247044] [2019-11-15 21:34:38,009 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:38,010 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 21:34:38,010 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 21:34:38,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:38,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 21:34:38,016 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 21:34:38,114 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:38,115 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:38,115 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:38,115 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:38,115 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 21:34:38,115 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:38,115 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:38,115 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:38,115 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration27_Loop [2019-11-15 21:34:38,115 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:38,115 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:38,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:38,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:38,260 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:38,328 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:38,328 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 32 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 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:38,331 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 21:34:38,331 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_d52bffe3-9f68-4220-b616-1d3fcd8a804b/bin/uautomizer/z3 Starting monitored process 33 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 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:38,371 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 21:34:38,371 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 21:34:39,103 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 21:34:39,105 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 21:34:39,105 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 21:34:39,105 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 21:34:39,105 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 21:34:39,105 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 21:34:39,106 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 21:34:39,106 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 21:34:39,106 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 21:34:39,106 INFO L131 ssoRankerPreferences]: Filename of dumped script: byte_add-1.i_Iteration27_Loop [2019-11-15 21:34:39,106 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 21:34:39,106 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 21:34:39,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-11-15 21:34:39,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 21:34:39,241 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 45 [2019-11-15 21:34:39,345 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 21:34:39,346 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 21:34:39,346 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,346 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:39,346 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,346 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,347 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,347 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:39,347 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:39,347 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,350 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:39,350 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,350 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,350 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 21:34:39,350 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 21:34:39,351 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,351 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 21:34:39,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,352 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:39,352 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,352 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,352 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:39,352 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:39,353 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,366 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:39,366 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,366 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,366 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,367 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:39,367 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:39,367 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,368 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,368 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 21:34:39,368 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:39,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,369 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,369 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,369 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:39,370 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:39,370 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,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-11-15 21:34:39,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:39,374 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,374 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:39,375 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:39,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,375 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,375 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 21:34:39,376 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,376 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:39,376 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,376 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,376 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,377 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:39,377 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:39,377 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,382 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,383 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,383 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 21:34:39,383 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,384 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,384 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,384 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:39,384 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:39,385 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,385 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,385 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 21:34:39,386 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,386 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:39,386 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:39,386 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,387 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,387 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,387 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:39,388 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:39,388 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,394 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:39,394 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:39,394 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,395 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,395 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 21:34:39,395 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 21:34:39,395 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,396 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,396 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 21:34:39,397 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,397 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:39,398 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:39,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,398 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,398 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,398 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:39,400 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:39,400 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,407 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,409 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:39,409 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 21:34:39,409 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,409 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:39,410 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:39,410 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,412 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 21:34:39,412 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,413 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:39,413 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:39,413 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,413 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,414 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:39,416 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:39,416 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,457 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,458 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,458 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:39,458 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:39,458 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,459 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,459 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 21:34:39,460 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 21:34:39,460 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,461 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 21:34:39,462 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,462 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:39,462 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:39,463 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,463 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:39,464 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:39,464 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,472 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,472 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,473 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:39,473 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 21:34:39,473 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,473 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,473 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,474 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 21:34:39,474 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 21:34:39,474 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,477 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,477 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 21:34:39,477 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,477 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:39,478 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:39,478 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,478 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:39,480 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:39,480 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,499 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,499 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 21:34:39,500 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 21:34:39,500 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 21:34:39,500 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 21:34:39,500 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 21:34:39,500 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 21:34:39,500 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 21:34:39,501 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 21:34:39,501 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 21:34:39,506 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 21:34:39,506 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 21:34:39,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-11-15 21:34:39,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2019-11-15 21:34:39,507 INFO L87 Difference]: Start difference. First operand 217 states and 231 transitions. cyclomatic complexity: 15 Second operand 18 states. [2019-11-15 21:34:41,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 21:34:41,155 INFO L93 Difference]: Finished difference Result 298 states and 313 transitions. [2019-11-15 21:34:41,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-11-15 21:34:41,156 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 298 states and 313 transitions. [2019-11-15 21:34:41,156 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:34:41,157 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 298 states to 0 states and 0 transitions. [2019-11-15 21:34:41,157 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 21:34:41,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 21:34:41,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 21:34:41,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 21:34:41,157 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:34:41,157 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:34:41,157 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 21:34:41,157 INFO L424 BuchiCegarLoop]: ======== Iteration 28============ [2019-11-15 21:34:41,157 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 21:34:41,157 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 21:34:41,157 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 21:34:41,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 09:34:41 BoogieIcfgContainer [2019-11-15 21:34:41,163 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 21:34:41,163 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 21:34:41,163 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 21:34:41,164 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 21:34:41,164 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 09:29:43" (3/4) ... [2019-11-15 21:34:41,166 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 21:34:41,166 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 21:34:41,167 INFO L168 Benchmark]: Toolchain (without parser) took 298955.56 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 249.6 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -131.0 MB). Peak memory consumption was 118.6 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:41,167 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:34:41,168 INFO L168 Benchmark]: CACSL2BoogieTranslator took 382.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:41,168 INFO L168 Benchmark]: Boogie Procedure Inliner took 45.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:34:41,168 INFO L168 Benchmark]: Boogie Preprocessor took 28.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:41,169 INFO L168 Benchmark]: RCFGBuilder took 432.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:41,169 INFO L168 Benchmark]: BuchiAutomizer took 298058.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 137.5 MB. Max. memory is 11.5 GB. [2019-11-15 21:34:41,169 INFO L168 Benchmark]: Witness Printer took 3.20 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 21:34:41,171 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.27 ms. Allocated memory is still 1.0 GB. Free memory is still 958.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 382.91 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 113.8 MB). Free memory was 941.0 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 23.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 45.52 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 432.38 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.0 MB). Peak memory consumption was 29.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 298058.91 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 135.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 1.8 MB). Peak memory consumption was 137.5 MB. Max. memory is 11.5 GB. * Witness Printer took 3.20 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 27 terminating modules (27 trivial, 0 deterministic, 0 nondeterministic). 27 modules have a trivial ranking function, the largest among these consists of 18 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 297.9s and 28 iterations. TraceHistogramMax:7. Analysis of lassos took 120.4s. Construction of modules took 154.6s. Büchi inclusion checks took 21.8s. Highest rank in rank-based complementation 0. Minimization of det autom 27. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 26 MinimizatonAttempts, 6033 StatesRemovedByMinimization, 25 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 1128 states and ocurred in iteration 16. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1071 SDtfs, 5126 SDslu, 2621 SDs, 0 SdLazy, 11817 SolverSat, 878 SolverUnsat, 28 SolverUnknown, 0 SolverNotchecked, 154.6s Time LassoAnalysisResults: nont0 unkn0 SFLI16 SFLT0 conc1 concLT0 SILN0 SILU8 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital61 mio100 ax100 hnf96 lsp83 ukn100 mio100 lsp100 div393 bol100 ite100 ukn100 eq146 hnf47 smp69 dnf110 smp99 tf102 neg98 sie104 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 119ms VariablesStem: 0 VariablesLoop: 20 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 8 LassoNonterminationAnalysisUnknown: 1 LassoNonterminationAnalysisTime: 30.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...