./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label38.c --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_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label38.c -s /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 04fd81e9543232110dc189b4b001c0bb7a784bec ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-11-15 20:39:50,485 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:39:50,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:39:50,504 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:39:50,504 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:39:50,506 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:39:50,508 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:39:50,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:39:50,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:39:50,521 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:39:50,527 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:39:50,528 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:39:50,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:39:50,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:39:50,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:39:50,531 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:39:50,532 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:39:50,533 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:39:50,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:39:50,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:39:50,538 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:39:50,539 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:39:50,540 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:39:50,545 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:39:50,547 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:39:50,547 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:39:50,548 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:39:50,549 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:39:50,549 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:39:50,550 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:39:50,550 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:39:50,551 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:39:50,552 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:39:50,553 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:39:50,554 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:39:50,554 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:39:50,555 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:39:50,555 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:39:50,555 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:39:50,556 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:39:50,557 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:39:50,558 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2019-11-15 20:39:50,574 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:39:50,574 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:39:50,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:39:50,576 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:39:50,576 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:39:50,576 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:39:50,576 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:39:50,577 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:39:50,577 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:39:50,577 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:39:50,577 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:39:50,578 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:39:50,578 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 20:39:50,578 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:39:50,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:39:50,579 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 20:39:50,579 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:39:50,579 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:39:50,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:39:50,589 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:39:50,590 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 20:39:50,590 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:39:50,590 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:39:50,590 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:39:50,591 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:39:50,591 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:39:50,592 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:39:50,592 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:39:50,593 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:39:50,593 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:39:50,594 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:39:50,594 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:39:50,595 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_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 -> 04fd81e9543232110dc189b4b001c0bb7a784bec [2019-11-15 20:39:50,623 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:39:50,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:39:50,640 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:39:50,641 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:39:50,641 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:39:50,642 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label38.c [2019-11-15 20:39:50,695 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/data/53920ce45/73c10e81cb62470d87ce3e45edbf8acc/FLAG1ea1b692a [2019-11-15 20:39:51,187 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:39:51,187 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/sv-benchmarks/c/eca-rers2012/Problem02_label38.c [2019-11-15 20:39:51,212 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/data/53920ce45/73c10e81cb62470d87ce3e45edbf8acc/FLAG1ea1b692a [2019-11-15 20:39:51,713 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/data/53920ce45/73c10e81cb62470d87ce3e45edbf8acc [2019-11-15 20:39:51,716 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:39:51,717 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:39:51,719 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:39:51,719 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:39:51,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:39:51,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:39:51" (1/1) ... [2019-11-15 20:39:51,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41d630d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:51, skipping insertion in model container [2019-11-15 20:39:51,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:39:51" (1/1) ... [2019-11-15 20:39:51,733 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:39:51,773 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:39:52,190 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:39:52,195 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:39:52,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:39:52,300 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:39:52,300 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52 WrapperNode [2019-11-15 20:39:52,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:39:52,301 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:39:52,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:39:52,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:39:52,308 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (1/1) ... [2019-11-15 20:39:52,325 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (1/1) ... [2019-11-15 20:39:52,379 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:39:52,380 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:39:52,382 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:39:52,382 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:39:52,389 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (1/1) ... [2019-11-15 20:39:52,390 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (1/1) ... [2019-11-15 20:39:52,394 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (1/1) ... [2019-11-15 20:39:52,394 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (1/1) ... [2019-11-15 20:39:52,431 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (1/1) ... [2019-11-15 20:39:52,454 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (1/1) ... [2019-11-15 20:39:52,459 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (1/1) ... [2019-11-15 20:39:52,479 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:39:52,480 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:39:52,480 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:39:52,480 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:39:52,481 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 20:39:52,548 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:39:52,548 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:39:53,775 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:39:53,775 INFO L284 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-15 20:39:53,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:53 BoogieIcfgContainer [2019-11-15 20:39:53,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:39:53,777 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:39:53,777 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:39:53,780 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:39:53,781 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:39:53,781 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:39:51" (1/3) ... [2019-11-15 20:39:53,782 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f1f886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:39:53, skipping insertion in model container [2019-11-15 20:39:53,782 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:39:53,782 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:52" (2/3) ... [2019-11-15 20:39:53,783 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1f1f886 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:39:53, skipping insertion in model container [2019-11-15 20:39:53,783 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:39:53,783 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:53" (3/3) ... [2019-11-15 20:39:53,785 INFO L371 chiAutomizerObserver]: Analyzing ICFG Problem02_label38.c [2019-11-15 20:39:53,829 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:39:53,829 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:39:53,829 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:39:53,830 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:39:53,830 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:39:53,831 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:39:53,831 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:39:53,831 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:39:53,868 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-11-15 20:39:53,906 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-11-15 20:39:53,906 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:53,906 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:53,915 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:39:53,915 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:39:53,915 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:39:53,916 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2019-11-15 20:39:53,924 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2019-11-15 20:39:53,924 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:53,924 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:53,925 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:39:53,925 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-11-15 20:39:53,933 INFO L791 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2019-11-15 20:39:53,933 INFO L793 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2019-11-15 20:39:53,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:53,939 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 20:39:53,946 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:53,946 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773853817] [2019-11-15 20:39:53,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:53,947 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:53,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:54,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:54,040 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:54,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:54,042 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2019-11-15 20:39:54,042 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:54,042 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187241618] [2019-11-15 20:39:54,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:54,042 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:54,043 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:54,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:54,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:54,070 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:54,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:54,071 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2019-11-15 20:39:54,072 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:54,072 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612597899] [2019-11-15 20:39:54,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:54,072 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:54,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:54,137 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 20:39:54,138 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612597899] [2019-11-15 20:39:54,138 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:54,139 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:39:54,139 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111116359] [2019-11-15 20:39:54,270 WARN L191 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2019-11-15 20:39:54,329 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:54,330 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:54,330 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:54,331 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:54,331 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:39:54,331 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:54,331 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:54,331 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:54,332 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label38.c_Iteration1_Loop [2019-11-15 20:39:54,332 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:54,333 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:54,358 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 20:39:54,366 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 20:39:54,407 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 20:39:54,414 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 20:39:54,418 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 20:39:54,422 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 20:39:54,425 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 20:39:54,436 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 20:39:54,697 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-11-15 20:39:54,782 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:54,783 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:39:54,800 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:54,800 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:54,810 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:54,810 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 3 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 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:54,827 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:54,827 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:39:54,835 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:54,836 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:54,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:54,846 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:39:54,853 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:54,853 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:39:54,869 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:54,869 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:54,876 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:54,876 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:39:54,930 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:54,930 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:54,938 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:54,938 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:39:54,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:54,957 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:54,961 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:54,961 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:54,972 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:54,973 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:39:54,983 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:54,983 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:39:55,000 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:55,000 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2019-11-15 20:39:55,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:39:55,025 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:55,049 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:39:55,051 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:55,051 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:55,051 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:55,051 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:55,051 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:39:55,052 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:55,052 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:55,052 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:55,052 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label38.c_Iteration1_Loop [2019-11-15 20:39:55,052 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:55,052 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:55,057 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 20:39:55,074 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:55,079 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 20:39:55,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:55,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:55,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:55,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:55,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:55,384 WARN L191 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2019-11-15 20:39:55,427 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:55,433 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:39:55,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,450 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,451 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,451 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,451 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:55,453 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:55,454 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,464 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,473 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,474 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,474 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,474 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,475 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,476 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:55,476 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:55,477 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,479 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,484 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,484 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,485 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-15 20:39:55,485 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:55,488 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:55,489 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,532 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,532 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,534 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,534 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,534 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,534 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:55,535 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:55,535 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,552 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,554 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,555 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,555 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,555 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:55,556 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:55,556 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,560 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,561 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,562 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,562 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,562 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:55,563 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:55,563 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,565 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,566 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,566 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,566 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:55,567 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:55,567 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,568 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,568 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,569 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,569 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,569 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:55,569 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:55,570 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:55,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,575 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 20:39:55,575 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,576 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,577 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,578 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,578 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,586 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,587 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,587 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,587 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,587 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,587 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,588 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,588 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,591 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,592 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,592 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,592 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-15 20:39:55,592 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,594 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:39:55,594 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,624 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,625 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,626 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,626 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,631 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,631 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,631 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,631 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,632 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,632 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,635 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,636 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,637 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,639 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,639 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,640 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,640 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,640 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,641 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,641 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,641 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,641 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,642 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,643 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,643 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,646 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:55,646 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,647 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:55,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,659 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 20:39:55,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,660 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,661 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,661 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:55,662 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:55,662 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,669 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,670 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,670 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,670 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,671 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,671 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:55,671 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:55,678 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,686 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,687 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,687 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,687 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,687 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-15 20:39:55,687 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:55,690 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:39:55,690 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,737 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,738 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,738 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,738 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,739 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,739 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,739 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:55,740 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:55,740 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,743 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,743 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,743 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,744 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,744 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,744 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,744 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:55,745 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:55,745 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,747 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,747 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,749 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,750 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:55,750 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:55,750 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,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 20:39:55,762 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,762 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,763 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,763 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,763 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:55,764 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:55,764 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,766 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,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 20:39:55,767 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,767 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,768 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,768 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:55,768 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:55,769 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:55,769 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,776 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,777 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 20:39:55,777 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,778 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,778 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,778 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,778 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,778 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:55,783 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:55,783 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,793 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:55,794 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,795 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,796 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,796 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,796 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:55,796 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:55,796 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,799 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,799 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,807 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,807 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,807 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,807 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-15 20:39:55,808 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:55,816 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:39:55,816 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,831 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,832 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,833 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,833 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,833 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:55,834 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:55,834 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,838 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,838 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,838 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:55,839 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:55,839 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,840 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,842 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,842 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,842 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:55,842 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:55,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,845 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,845 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,845 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,846 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,846 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:55,846 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:55,846 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,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 20:39:55,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:55,848 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,848 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:55,848 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:55,849 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 20:39:55,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,854 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,854 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 20:39:55,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 20:39:55,855 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:55,855 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:55,855 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,856 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,856 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,857 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,857 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,870 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:55,871 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:55,871 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,871 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,872 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,872 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,875 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:55,875 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:55,875 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,876 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-15 20:39:55,876 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,878 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:39:55,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,921 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:55,921 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:55,921 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,923 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,924 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,924 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,925 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,925 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,939 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:55,940 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:55,940 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:55,940 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,941 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,941 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,941 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,942 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,942 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,944 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,947 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:55,947 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:55,948 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,948 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,948 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,948 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,949 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,949 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,952 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,952 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,953 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:55,953 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:55,953 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,954 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,954 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,954 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,955 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:55,955 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,956 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:55,957 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:55,957 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:55,958 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,958 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:55,959 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:55,960 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:55,960 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,966 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,966 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 20:39:55,966 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:55,967 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:55,967 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:55,968 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,968 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,968 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:55,968 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:55,970 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:55,970 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:55,998 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:55,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:55,999 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:55,999 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:55,999 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:55,999 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:55,999 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,000 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,000 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,001 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,004 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,004 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:56,005 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,005 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:56,005 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,005 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,005 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-15 20:39:56,005 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,009 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:39:56,009 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,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 20:39:56,091 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,091 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:56,091 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,092 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,093 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,093 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,099 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,100 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,100 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:56,101 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,101 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,101 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,101 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,102 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,102 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,109 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,109 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:56,109 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,109 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,109 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,110 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,110 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,110 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,114 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,115 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,115 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:56,116 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,116 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,116 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,116 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,117 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,117 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,119 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:56,120 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,120 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:56,120 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,121 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,121 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:56,122 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,123 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:56,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,137 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,137 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 20:39:56,137 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,138 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,138 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,138 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,138 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,139 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,139 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:56,141 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:56,141 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,152 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,152 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:56,153 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,153 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,153 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,154 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,154 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,154 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:56,155 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:56,155 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,161 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,161 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,161 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,161 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-15 20:39:56,161 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:56,166 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:39:56,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,304 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,305 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:56,306 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,306 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,306 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,306 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,306 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,306 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:56,310 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:56,310 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,330 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,330 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:56,331 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,331 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,331 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,331 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,331 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,331 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:56,332 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:56,332 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,336 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,337 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,337 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,337 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,337 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,338 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,338 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,338 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:56,339 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:56,339 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,360 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,360 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,360 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,360 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:56,361 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:56,361 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,362 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,362 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:56,363 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,363 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,363 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,363 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,363 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:56,364 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:56,366 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 20:39:56,366 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,397 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,397 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 20:39:56,398 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,398 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,398 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:56,398 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,399 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,399 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,399 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,399 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,400 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,420 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,420 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:56,420 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,421 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,421 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,421 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,421 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,421 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,423 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,424 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,425 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,425 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:56,425 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,425 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-15 20:39:56,426 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,427 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:39:56,427 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,474 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,476 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:56,477 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,477 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:56,477 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,478 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,478 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,478 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,478 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,479 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,483 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,484 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,485 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,485 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:56,485 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,486 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,486 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,486 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,486 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,486 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,501 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,501 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,502 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,502 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:56,502 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,502 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,502 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,503 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,503 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,503 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,505 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,505 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,506 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,506 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:56,506 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,506 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,507 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,507 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,507 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:56,507 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,509 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,509 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,510 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,510 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:56,510 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,510 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,510 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:56,510 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:56,511 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:56,511 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,533 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 20:39:56,534 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,535 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,535 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,535 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,536 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,536 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,536 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:56,538 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:56,538 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,682 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,683 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,684 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,684 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,684 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:56,685 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:56,685 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,690 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,691 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,691 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,692 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,692 INFO L203 nArgumentSynthesizer]: 3 loop disjuncts [2019-11-15 20:39:56,692 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:56,705 INFO L400 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2019-11-15 20:39:56,705 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,864 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,864 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,864 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,865 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:56,866 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:56,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,876 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,877 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,877 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,878 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:56,878 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:56,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,881 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,883 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,883 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,883 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:56,884 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:56,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,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 20:39:56,888 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,889 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,890 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,890 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:56,890 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:56,891 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:56,891 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:56,897 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:56,897 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:56,897 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:56,897 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:56,898 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:56,898 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:56,899 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:39:56,899 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:56,909 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:56,910 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:56,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:39:56,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:39:56,927 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2019-11-15 20:39:57,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:57,848 INFO L93 Difference]: Finished difference Result 374 states and 489 transitions. [2019-11-15 20:39:57,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:39:57,850 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 374 states and 489 transitions. [2019-11-15 20:39:57,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 305 [2019-11-15 20:39:57,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 374 states to 307 states and 409 transitions. [2019-11-15 20:39:57,875 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 307 [2019-11-15 20:39:57,879 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 307 [2019-11-15 20:39:57,880 INFO L73 IsDeterministic]: Start isDeterministic. Operand 307 states and 409 transitions. [2019-11-15 20:39:57,886 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:39:57,887 INFO L688 BuchiCegarLoop]: Abstraction has 307 states and 409 transitions. [2019-11-15 20:39:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states and 409 transitions. [2019-11-15 20:39:57,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2019-11-15 20:39:57,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2019-11-15 20:39:57,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2019-11-15 20:39:57,958 INFO L711 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-11-15 20:39:57,958 INFO L591 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2019-11-15 20:39:57,958 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:39:57,958 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2019-11-15 20:39:57,961 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2019-11-15 20:39:57,961 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:57,961 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:57,964 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:39:57,964 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:57,964 INFO L791 eck$LassoCheckResult]: Stem: 765#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 630#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 631#L606-2 [2019-11-15 20:39:57,973 INFO L793 eck$LassoCheckResult]: Loop: 631#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 720#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 756#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 760#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 776#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 712#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 713#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 705#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 633#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 631#L606-2 [2019-11-15 20:39:57,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:57,973 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2019-11-15 20:39:57,973 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:57,974 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962077884] [2019-11-15 20:39:57,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:57,974 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:57,974 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:57,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:57,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:57,981 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:57,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:57,982 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2019-11-15 20:39:57,982 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:57,982 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753740376] [2019-11-15 20:39:57,982 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:57,983 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:57,983 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:57,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:58,015 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:58,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:58,016 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2019-11-15 20:39:58,016 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:58,017 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825423449] [2019-11-15 20:39:58,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:58,017 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:58,017 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:58,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:58,038 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 20:39:58,039 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825423449] [2019-11-15 20:39:58,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:58,039 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 20:39:58,039 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494303847] [2019-11-15 20:39:58,158 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2019-11-15 20:39:58,199 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:58,199 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:58,199 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:58,199 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:58,199 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:39:58,199 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:58,199 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:58,199 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:58,199 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label38.c_Iteration2_Loop [2019-11-15 20:39:58,200 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:58,200 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:58,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:58,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:58,212 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 20:39:58,215 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 20:39:58,217 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 20:39:58,220 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 20:39:58,225 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 20:39:58,239 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 20:39:58,446 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:58,446 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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) [2019-11-15 20:39:58,456 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:58,456 INFO L160 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:58,461 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:58,461 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 20:39:58,478 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:58,478 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:39:58,483 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:58,483 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 20:39:58,488 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:58,488 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:39:58,491 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:58,492 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 20:39:58,512 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:58,512 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:39:58,515 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:58,515 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:58,519 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:58,519 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:39:58,523 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:39:58,523 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:58,530 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:39:58,530 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:58,551 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:39:58,551 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:39:58,568 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2019-11-15 20:39:58,569 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:58,569 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:58,569 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:58,569 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:58,569 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:39:58,570 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:58,570 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:58,570 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:58,570 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label38.c_Iteration2_Loop [2019-11-15 20:39:58,570 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:58,570 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:58,572 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 20:39:58,575 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 20:39:58,577 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 20:39:58,579 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 20:39:58,582 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 20:39:58,588 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 20:39:58,611 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 20:39:58,620 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 20:39:58,835 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:58,835 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:39:58,835 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,836 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,836 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,836 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:58,836 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:58,836 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,837 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,837 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,838 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,838 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,838 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,838 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,838 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:58,838 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,838 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,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 20:39:58,840 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,840 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,840 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:58,840 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:58,840 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,841 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,841 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,841 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,841 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,842 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,842 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:58,842 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:58,842 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,843 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,843 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,844 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,844 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,844 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:58,844 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,844 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,846 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,846 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,846 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,847 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,847 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:58,847 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,850 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,850 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,850 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,851 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,851 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,851 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:58,851 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:58,851 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,853 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,853 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,854 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:58,854 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:58,854 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,855 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,855 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 20:39:58,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 20:39:58,856 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,856 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,856 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,856 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,856 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,856 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:58,857 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,858 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,858 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,858 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,858 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,859 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,859 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:58,859 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,859 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,860 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,860 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,860 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,860 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,860 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,860 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,861 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:58,861 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,861 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,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 20:39:58,862 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,862 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,862 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,862 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,862 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:58,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,864 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,864 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,864 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,865 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:58,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,867 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,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 20:39:58,868 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,868 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,868 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,868 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,868 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,869 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:58,869 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,873 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,873 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,874 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,874 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,874 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,874 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,874 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:58,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,877 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,877 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,878 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,878 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,878 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,878 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:58,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,880 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 20:39:58,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 20:39:58,880 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,880 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,881 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,881 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,881 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,881 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,883 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,883 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,883 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,883 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:58,884 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,884 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,885 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,885 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,885 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,885 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,885 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,885 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,885 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,886 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,886 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,887 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,887 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,887 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,887 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,887 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,888 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,889 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,889 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,889 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,889 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,889 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,890 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,890 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:58,890 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,893 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,893 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,894 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,894 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,894 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,894 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,894 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,895 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:58,895 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,900 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,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 20:39:58,901 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,901 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,901 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,901 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,901 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,902 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,902 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,905 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,906 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,906 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,906 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,906 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,906 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,906 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,907 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,908 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 20:39:58,909 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,909 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,909 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,909 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,910 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:58,910 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:58,910 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,911 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,912 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,912 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,912 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,912 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,913 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,913 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:58,913 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 20:39:58,913 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,914 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,914 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,914 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,914 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,915 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,915 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,915 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:58,915 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:58,915 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,916 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,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 20:39:58,917 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,917 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,917 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,917 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,917 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:58,917 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:58,917 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,919 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,919 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,920 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,920 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,920 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,920 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,920 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:58,921 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 20:39:58,921 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,924 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,925 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,925 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,925 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,925 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,925 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,925 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:58,926 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 20:39:58,926 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,932 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,932 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,933 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,933 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,933 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,933 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,933 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:58,934 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:58,934 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,938 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,938 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,938 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:58,938 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,939 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,939 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,939 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:58,939 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:58,939 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,942 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,942 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 20:39:58,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 20:39:58,943 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,943 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:58,943 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,943 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,943 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,943 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,943 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:58,944 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,946 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,946 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:58,946 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,946 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,947 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,947 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,947 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:58,947 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,948 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,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 20:39:58,949 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,949 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:58,949 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,949 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,949 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,949 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,950 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:58,950 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,950 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,950 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,951 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,951 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:58,951 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,951 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,951 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,951 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,952 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:58,952 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,954 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,954 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,954 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,954 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:58,955 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,955 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,955 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,955 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,956 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:58,956 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,959 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,960 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,960 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,960 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:58,960 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,961 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,961 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,961 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,962 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:58,962 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,969 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,969 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,970 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,970 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:58,970 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,970 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,970 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,970 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,971 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:58,971 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,978 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,978 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,979 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,979 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:58,979 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,979 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,979 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,979 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:39:58,980 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:39:58,980 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,982 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,982 INFO L489 LassoAnalysis]: Using template '3-phase'. [2019-11-15 20:39:58,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 20:39:58,983 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,983 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:58,983 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,983 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,983 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,984 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,984 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,984 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,987 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,987 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,987 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:58,988 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,988 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,988 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,988 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,989 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:58,989 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,990 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,990 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:58,991 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,991 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:58,991 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,991 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,991 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,991 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,992 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,992 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,993 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,993 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:58,994 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,994 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:58,994 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,994 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,994 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:58,994 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:58,995 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:58,995 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:58,997 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:58,998 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:58,998 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:58,998 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:58,998 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:58,998 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:58,999 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:58,999 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,000 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:59,000 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,005 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,006 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:59,006 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,006 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:59,006 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,007 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,007 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:59,007 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,009 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:59,009 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,026 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,027 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,027 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:59,027 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,027 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,027 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,029 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:59,029 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,035 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,035 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,035 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,036 INFO L337 nArgumentSynthesizer]: Template has degree 2. [2019-11-15 20:39:59,036 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,036 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,036 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,036 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,037 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:59,037 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,041 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,041 INFO L489 LassoAnalysis]: Using template '4-phase'. [2019-11-15 20:39:59,041 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:59,042 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,042 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,042 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,042 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,042 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,042 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:59,043 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:59,043 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,047 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,047 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,048 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,048 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,048 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,048 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,048 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:59,049 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:59,050 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 20:39:59,050 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,051 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,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 20:39:59,052 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,052 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,052 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,052 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,052 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:59,053 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:59,053 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,054 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,054 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,054 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,054 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,055 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,055 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,055 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,055 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:59,056 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:59,056 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,060 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,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 20:39:59,060 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,061 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,061 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,061 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,061 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:59,061 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:59,063 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 20:39:59,063 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,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 20:39:59,073 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,073 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,073 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,073 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,073 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:59,073 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:59,076 INFO L400 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2019-11-15 20:39:59,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,097 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,097 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,097 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,097 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:59,100 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:59,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,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 20:39:59,110 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,110 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,110 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:39:59,112 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:39:59,112 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,118 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,118 INFO L489 LassoAnalysis]: Using template '2-lex'. [2019-11-15 20:39:59,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,119 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,119 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:59,119 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,119 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,119 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,120 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:59,120 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,122 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:59,122 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,122 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:59,123 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,123 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:59,123 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,123 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:59,123 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,125 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,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 20:39:59,125 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,126 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:59,126 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,126 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,126 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,126 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,126 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:59,127 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,128 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,128 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:59,128 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,128 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:59,129 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,129 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,129 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,129 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,129 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:59,129 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:59,132 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,132 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:59,132 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,132 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,132 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:59,132 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,133 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:59,133 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,138 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,139 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,139 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,139 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:59,139 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,139 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,139 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:59,140 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,140 INFO L400 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2019-11-15 20:39:59,141 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,148 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,149 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,149 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,149 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:59,149 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,149 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,150 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,150 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,150 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:59,151 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,160 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,160 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,160 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,161 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:39:59,161 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,161 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,161 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,161 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:39:59,161 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:59,162 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,165 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,165 INFO L489 LassoAnalysis]: Using template '3-lex'. [2019-11-15 20:39:59,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,166 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,166 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,166 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,166 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,166 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,166 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:59,167 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:59,167 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,170 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,170 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,171 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,171 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,171 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,171 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,171 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:59,171 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:59,172 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:39:59,172 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,174 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,174 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,175 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,175 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,175 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,175 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,175 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,175 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:59,176 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:59,176 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,178 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,179 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,179 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,179 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,179 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:59,180 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:59,180 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,182 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,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 20:39:59,183 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,183 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,183 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,184 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:59,184 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:59,185 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:39:59,185 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,203 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,203 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,204 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,204 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,204 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,204 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,204 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:59,205 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:59,206 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:39:59,207 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,243 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,244 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number 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 20:39:59,244 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,245 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,245 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,245 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,245 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,245 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:59,247 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:59,247 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,277 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,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 20:39:59,278 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:39:59,278 INFO L337 nArgumentSynthesizer]: Template has degree 3. [2019-11-15 20:39:59,278 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:59,278 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:59,278 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:59,278 INFO L204 nArgumentSynthesizer]: 6 template conjuncts. [2019-11-15 20:39:59,279 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:59,279 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:59,288 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:59,288 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:59,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:39:59,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:39:59,289 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2019-11-15 20:39:59,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:59,824 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2019-11-15 20:39:59,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:39:59,825 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2019-11-15 20:39:59,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-11-15 20:39:59,835 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2019-11-15 20:39:59,835 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2019-11-15 20:39:59,836 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2019-11-15 20:39:59,836 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2019-11-15 20:39:59,838 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:39:59,838 INFO L688 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-11-15 20:39:59,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2019-11-15 20:39:59,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-11-15 20:39:59,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-11-15 20:39:59,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2019-11-15 20:39:59,878 INFO L711 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-11-15 20:39:59,878 INFO L591 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2019-11-15 20:39:59,879 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:39:59,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2019-11-15 20:39:59,886 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2019-11-15 20:39:59,886 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:59,886 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:59,886 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:39:59,886 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1] [2019-11-15 20:39:59,887 INFO L791 eck$LassoCheckResult]: Stem: 1676#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1534#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1535#L606-2 [2019-11-15 20:39:59,887 INFO L793 eck$LassoCheckResult]: Loop: 1535#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2015#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2014#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 2013#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1531#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1626#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1662#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1669#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1688#L38 assume 1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0;~a28~0 := 7;~a25~0 := 1;calculate_output_#res := 22; 1567#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1535#L606-2 [2019-11-15 20:39:59,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:59,887 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2019-11-15 20:39:59,887 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:59,887 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474739156] [2019-11-15 20:39:59,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:59,887 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:59,887 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:59,893 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:59,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:59,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1689438932, now seen corresponding path program 1 times [2019-11-15 20:39:59,894 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:59,894 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714606868] [2019-11-15 20:39:59,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:59,894 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:59,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:59,905 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714606868] [2019-11-15 20:39:59,905 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:59,906 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:39:59,906 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125632298] [2019-11-15 20:39:59,906 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:39:59,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:59,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:39:59,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:39:59,907 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 3 states. [2019-11-15 20:40:00,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:00,524 INFO L93 Difference]: Finished difference Result 1149 states and 1416 transitions. [2019-11-15 20:40:00,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:40:00,527 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1149 states and 1416 transitions. [2019-11-15 20:40:00,537 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-11-15 20:40:00,547 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-11-15 20:40:00,547 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1149 [2019-11-15 20:40:00,548 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1149 [2019-11-15 20:40:00,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1149 states and 1416 transitions. [2019-11-15 20:40:00,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:00,550 INFO L688 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-11-15 20:40:00,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states and 1416 transitions. [2019-11-15 20:40:00,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1149. [2019-11-15 20:40:00,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1149 states. [2019-11-15 20:40:00,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1149 states to 1149 states and 1416 transitions. [2019-11-15 20:40:00,571 INFO L711 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-11-15 20:40:00,571 INFO L591 BuchiCegarLoop]: Abstraction has 1149 states and 1416 transitions. [2019-11-15 20:40:00,571 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:40:00,571 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1149 states and 1416 transitions. [2019-11-15 20:40:00,579 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1147 [2019-11-15 20:40:00,579 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:00,579 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:00,580 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:00,581 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:00,581 INFO L791 eck$LassoCheckResult]: Stem: 3407#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3278#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3279#L606-2 [2019-11-15 20:40:00,581 INFO L793 eck$LassoCheckResult]: Loop: 3279#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3366#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3399#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3402#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 3275#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3645#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3642#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3639#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3636#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3633#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3630#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3627#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3624#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3621#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3618#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3615#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3612#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3609#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3606#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3602#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3599#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3596#L99 assume (!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res := -1; 3560#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3644#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3641#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3638#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3635#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3632#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3629#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3626#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3623#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3620#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3617#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3614#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3611#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3608#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3604#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3601#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3598#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3595#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3592#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3589#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3586#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3583#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3580#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3577#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3573#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3570#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3567#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3564#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 3421#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3279#L606-2 [2019-11-15 20:40:00,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:00,582 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2019-11-15 20:40:00,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:00,582 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577274736] [2019-11-15 20:40:00,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:00,582 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:00,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:00,588 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:00,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:00,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1352924138, now seen corresponding path program 1 times [2019-11-15 20:40:00,589 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:00,589 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10253211] [2019-11-15 20:40:00,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:00,589 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:00,589 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:00,618 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:40:00,618 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10253211] [2019-11-15 20:40:00,618 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:00,618 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:40:00,618 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24521257] [2019-11-15 20:40:00,619 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:40:00,619 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:00,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:40:00,619 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:40:00,619 INFO L87 Difference]: Start difference. First operand 1149 states and 1416 transitions. cyclomatic complexity: 268 Second operand 3 states. [2019-11-15 20:40:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:01,168 INFO L93 Difference]: Finished difference Result 1996 states and 2450 transitions. [2019-11-15 20:40:01,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:40:01,168 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1996 states and 2450 transitions. [2019-11-15 20:40:01,186 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1994 [2019-11-15 20:40:01,202 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1996 states to 1996 states and 2450 transitions. [2019-11-15 20:40:01,202 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1996 [2019-11-15 20:40:01,204 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1996 [2019-11-15 20:40:01,204 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1996 states and 2450 transitions. [2019-11-15 20:40:01,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:01,207 INFO L688 BuchiCegarLoop]: Abstraction has 1996 states and 2450 transitions. [2019-11-15 20:40:01,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1996 states and 2450 transitions. [2019-11-15 20:40:01,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1996 to 1710. [2019-11-15 20:40:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1710 states. [2019-11-15 20:40:01,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2146 transitions. [2019-11-15 20:40:01,241 INFO L711 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-11-15 20:40:01,241 INFO L591 BuchiCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2019-11-15 20:40:01,241 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:40:01,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1710 states and 2146 transitions. [2019-11-15 20:40:01,252 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1708 [2019-11-15 20:40:01,252 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:01,252 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:01,254 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:01,254 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, 1, 1, 1, 1] [2019-11-15 20:40:01,254 INFO L791 eck$LassoCheckResult]: Stem: 6571#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6430#L606-2 [2019-11-15 20:40:01,254 INFO L793 eck$LassoCheckResult]: Loop: 6430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6521#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6563#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6566#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6582#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6513#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6514#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6506#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 6443#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6994#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6992#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6990#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6988#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6986#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6984#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6982#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6980#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6978#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6976#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6974#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6972#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6970#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6968#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6966#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6964#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6962#L99 assume (!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0;~a17~0 := 7;~a25~0 := 0;~a11~0 := 1;~a28~0 := 10;~a19~0 := 0;calculate_output_#res := -1; 6879#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7193#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7188#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7183#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 7178#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 7173#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 7168#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 7164#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 7160#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 7155#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 7150#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 7145#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 7140#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 7135#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 7129#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 7124#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 7118#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 7112#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 7106#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 7100#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6937#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6806#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6801#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6795#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6789#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6783#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6776#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6775#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 6587#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6430#L606-2 [2019-11-15 20:40:01,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:01,255 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2019-11-15 20:40:01,255 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:01,255 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908759788] [2019-11-15 20:40:01,255 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:01,256 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:01,256 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:01,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:01,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:01,265 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:01,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:01,266 INFO L82 PathProgramCache]: Analyzing trace with hash -879392628, now seen corresponding path program 1 times [2019-11-15 20:40:01,266 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:01,266 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108040654] [2019-11-15 20:40:01,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:01,266 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:01,266 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 20:40:01,308 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108040654] [2019-11-15 20:40:01,308 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:01,308 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:40:01,309 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197893713] [2019-11-15 20:40:01,309 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:40:01,309 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:01,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:40:01,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:40:01,310 INFO L87 Difference]: Start difference. First operand 1710 states and 2146 transitions. cyclomatic complexity: 437 Second operand 3 states. [2019-11-15 20:40:01,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:01,854 INFO L93 Difference]: Finished difference Result 1709 states and 1964 transitions. [2019-11-15 20:40:01,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:40:01,854 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1709 states and 1964 transitions. [2019-11-15 20:40:01,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1707 [2019-11-15 20:40:01,878 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1709 states to 1709 states and 1964 transitions. [2019-11-15 20:40:01,878 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1709 [2019-11-15 20:40:01,882 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1709 [2019-11-15 20:40:01,882 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1709 states and 1964 transitions. [2019-11-15 20:40:01,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:01,885 INFO L688 BuchiCegarLoop]: Abstraction has 1709 states and 1964 transitions. [2019-11-15 20:40:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1709 states and 1964 transitions. [2019-11-15 20:40:01,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1709 to 1429. [2019-11-15 20:40:01,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1429 states. [2019-11-15 20:40:01,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 1654 transitions. [2019-11-15 20:40:01,911 INFO L711 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-11-15 20:40:01,911 INFO L591 BuchiCegarLoop]: Abstraction has 1429 states and 1654 transitions. [2019-11-15 20:40:01,911 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:40:01,912 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1429 states and 1654 transitions. [2019-11-15 20:40:01,919 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1427 [2019-11-15 20:40:01,919 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:01,919 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:01,921 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:01,921 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:01,922 INFO L791 eck$LassoCheckResult]: Stem: 9998#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9854#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9855#L606-2 [2019-11-15 20:40:01,922 INFO L793 eck$LassoCheckResult]: Loop: 9855#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10437#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10431#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 10415#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 9851#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10406#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10404#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10402#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 9925#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 11190#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9985#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9986#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11076#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11077#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 9940#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 9941#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 9934#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 9857#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 9858#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 9859#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 9860#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 9960#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10012#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 9961#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 9879#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 9880#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10001#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 9932#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10320#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10318#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10316#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 10314#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 10261#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 10257#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 10252#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 10247#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 10242#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10237#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 10232#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 10227#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 10222#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 10215#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 10212#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 10209#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 10206#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 10203#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 10200#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 10196#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 10192#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 10188#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 10184#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 10180#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 10176#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10172#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 10168#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 10134#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9855#L606-2 [2019-11-15 20:40:01,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:01,922 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2019-11-15 20:40:01,922 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:01,923 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [684995555] [2019-11-15 20:40:01,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:01,923 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:01,924 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:01,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:01,940 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:01,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:01,941 INFO L82 PathProgramCache]: Analyzing trace with hash 274284660, now seen corresponding path program 1 times [2019-11-15 20:40:01,941 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:01,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900324364] [2019-11-15 20:40:01,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:01,941 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:01,941 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:01,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:01,985 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-11-15 20:40:01,985 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900324364] [2019-11-15 20:40:01,985 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:01,985 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:40:01,985 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496562718] [2019-11-15 20:40:01,986 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:40:01,986 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:01,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:40:01,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:40:01,986 INFO L87 Difference]: Start difference. First operand 1429 states and 1654 transitions. cyclomatic complexity: 226 Second operand 3 states. [2019-11-15 20:40:02,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:02,585 INFO L93 Difference]: Finished difference Result 1851 states and 2102 transitions. [2019-11-15 20:40:02,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:40:02,586 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1851 states and 2102 transitions. [2019-11-15 20:40:02,600 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1846 [2019-11-15 20:40:02,613 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1851 states to 1851 states and 2102 transitions. [2019-11-15 20:40:02,614 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1851 [2019-11-15 20:40:02,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1851 [2019-11-15 20:40:02,616 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1851 states and 2102 transitions. [2019-11-15 20:40:02,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:02,618 INFO L688 BuchiCegarLoop]: Abstraction has 1851 states and 2102 transitions. [2019-11-15 20:40:02,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1851 states and 2102 transitions. [2019-11-15 20:40:02,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1851 to 1849. [2019-11-15 20:40:02,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1849 states. [2019-11-15 20:40:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1849 states to 1849 states and 2099 transitions. [2019-11-15 20:40:02,648 INFO L711 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-11-15 20:40:02,648 INFO L591 BuchiCegarLoop]: Abstraction has 1849 states and 2099 transitions. [2019-11-15 20:40:02,649 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:40:02,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1849 states and 2099 transitions. [2019-11-15 20:40:02,659 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1844 [2019-11-15 20:40:02,659 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:02,659 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:02,663 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:02,663 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:40:02,663 INFO L791 eck$LassoCheckResult]: Stem: 13279#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13140#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13141#L606-2 [2019-11-15 20:40:02,665 INFO L793 eck$LassoCheckResult]: Loop: 13141#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14669#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14667#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14665#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 14663#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 14661#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 14659#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 14614#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 13154#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13488#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13486#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13484#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 13337#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 14108#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14106#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14104#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14102#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 14099#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 14100#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 14136#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 14134#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 14132#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 13511#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 13512#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 14445#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 14443#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 14020#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 14019#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 14017#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 14015#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 14013#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 14011#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 14009#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 14007#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 14005#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 14003#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 14001#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 13999#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 13997#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 13995#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 13993#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 13991#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 13989#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 13987#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 13985#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 13977#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 13973#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13969#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 13965#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 13961#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 13957#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 13953#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 13949#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 13945#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 13941#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 13937#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 13933#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 13929#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 13764#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 13765#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 13664#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 13665#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 13394#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13141#L606-2 [2019-11-15 20:40:02,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:02,665 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2019-11-15 20:40:02,665 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:02,666 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169239292] [2019-11-15 20:40:02,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:02,666 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:02,666 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:02,672 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:02,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:02,672 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2019-11-15 20:40:02,673 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:02,673 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295393602] [2019-11-15 20:40:02,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:02,673 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:02,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:02,719 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 20:40:02,720 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295393602] [2019-11-15 20:40:02,720 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:02,720 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:40:02,720 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1690542040] [2019-11-15 20:40:02,721 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:40:02,721 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:02,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:40:02,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:40:02,721 INFO L87 Difference]: Start difference. First operand 1849 states and 2099 transitions. cyclomatic complexity: 252 Second operand 3 states. [2019-11-15 20:40:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:03,265 INFO L93 Difference]: Finished difference Result 1989 states and 2244 transitions. [2019-11-15 20:40:03,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:40:03,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1989 states and 2244 transitions. [2019-11-15 20:40:03,281 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-11-15 20:40:03,294 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-11-15 20:40:03,295 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1989 [2019-11-15 20:40:03,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1989 [2019-11-15 20:40:03,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1989 states and 2244 transitions. [2019-11-15 20:40:03,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:03,300 INFO L688 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-11-15 20:40:03,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1989 states and 2244 transitions. [2019-11-15 20:40:03,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1989 to 1989. [2019-11-15 20:40:03,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1989 states. [2019-11-15 20:40:03,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1989 states to 1989 states and 2244 transitions. [2019-11-15 20:40:03,331 INFO L711 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-11-15 20:40:03,331 INFO L591 BuchiCegarLoop]: Abstraction has 1989 states and 2244 transitions. [2019-11-15 20:40:03,331 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:40:03,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1989 states and 2244 transitions. [2019-11-15 20:40:03,340 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1984 [2019-11-15 20:40:03,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:03,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:03,343 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:03,343 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:40:03,343 INFO L791 eck$LassoCheckResult]: Stem: 17120#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 16984#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 16985#L606-2 [2019-11-15 20:40:03,344 INFO L793 eck$LassoCheckResult]: Loop: 16985#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17073#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 17110#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 17114#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 16983#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 18289#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 18287#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 18285#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 18283#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 18281#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 18279#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 18277#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 18275#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 18273#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 18271#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 18269#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 18267#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 18265#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 18263#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 18261#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 18259#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 18257#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 18255#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 18253#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 18251#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 18249#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 18247#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 18245#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 18243#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 18241#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 18239#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 18237#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 18235#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 18233#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 18220#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 18221#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 18497#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 18493#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 18488#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 18482#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 17321#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 17322#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 18494#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 18489#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 18483#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 17323#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 17324#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 18333#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 18331#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 18329#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 18327#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 18325#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 18323#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 18321#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 18319#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 18317#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 18315#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 18313#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 18292#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 18293#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 18463#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 18462#L293 assume (1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0;~a28~0 := 7;~a25~0 := 1;calculate_output_#res := -1; 17133#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16985#L606-2 [2019-11-15 20:40:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2019-11-15 20:40:03,345 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:03,345 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363509199] [2019-11-15 20:40:03,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:03,345 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:03,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:03,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:03,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:03,357 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:03,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:03,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1740840234, now seen corresponding path program 1 times [2019-11-15 20:40:03,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:03,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058787120] [2019-11-15 20:40:03,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:03,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:03,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:03,424 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:40:03,424 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058787120] [2019-11-15 20:40:03,424 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:03,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-15 20:40:03,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488780255] [2019-11-15 20:40:03,426 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:40:03,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:03,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:40:03,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:40:03,427 INFO L87 Difference]: Start difference. First operand 1989 states and 2244 transitions. cyclomatic complexity: 257 Second operand 4 states. [2019-11-15 20:40:04,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:04,126 INFO L93 Difference]: Finished difference Result 2552 states and 2753 transitions. [2019-11-15 20:40:04,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-15 20:40:04,127 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2552 states and 2753 transitions. [2019-11-15 20:40:04,139 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 2546 [2019-11-15 20:40:04,154 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2552 states to 2552 states and 2753 transitions. [2019-11-15 20:40:04,154 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2552 [2019-11-15 20:40:04,157 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2552 [2019-11-15 20:40:04,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2552 states and 2753 transitions. [2019-11-15 20:40:04,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:04,160 INFO L688 BuchiCegarLoop]: Abstraction has 2552 states and 2753 transitions. [2019-11-15 20:40:04,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2552 states and 2753 transitions. [2019-11-15 20:40:04,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2552 to 2130. [2019-11-15 20:40:04,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2130 states. [2019-11-15 20:40:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2130 states to 2130 states and 2325 transitions. [2019-11-15 20:40:04,196 INFO L711 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-11-15 20:40:04,196 INFO L591 BuchiCegarLoop]: Abstraction has 2130 states and 2325 transitions. [2019-11-15 20:40:04,196 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 20:40:04,196 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2130 states and 2325 transitions. [2019-11-15 20:40:04,203 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2124 [2019-11-15 20:40:04,203 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:04,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:04,204 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:04,205 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2019-11-15 20:40:04,205 INFO L791 eck$LassoCheckResult]: Stem: 21661#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 21532#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 21533#L606-2 [2019-11-15 20:40:04,205 INFO L793 eck$LassoCheckResult]: Loop: 21533#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 23339#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 23336#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 23333#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 23330#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 23327#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 23324#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 22297#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 22298#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 23465#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 23463#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 23461#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 23459#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 23457#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 23455#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 23453#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 23451#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 23449#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 23447#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 23445#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 23443#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 23441#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 23438#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 23435#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 23432#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 23429#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 23427#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 23425#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 23423#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 21546#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 21839#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 21837#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 21834#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 21835#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 22351#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 22349#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 22347#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 22345#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 22343#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 22341#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 22339#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 22337#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 22335#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 22333#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 22331#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 22329#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 22327#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 22325#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 22323#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 22321#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 22319#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 22317#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 22315#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 22313#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 22311#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 22309#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 22307#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 22134#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 22135#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 22949#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 22944#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 22361#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 22362#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 22922#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 22916#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 22910#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 22904#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 22898#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 22892#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 22886#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 22576#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 22577#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 22583#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 22566#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 22561#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 22359#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 22360#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 22663#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 22661#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 22659#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 22657#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 22655#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 22653#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 22024#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 21533#L606-2 [2019-11-15 20:40:04,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:04,205 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2019-11-15 20:40:04,205 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:04,206 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127458169] [2019-11-15 20:40:04,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:04,206 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:04,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:04,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:04,210 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:04,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:04,212 INFO L82 PathProgramCache]: Analyzing trace with hash -1701192337, now seen corresponding path program 1 times [2019-11-15 20:40:04,212 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:04,212 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017623124] [2019-11-15 20:40:04,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:04,212 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:04,212 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:04,301 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-15 20:40:04,301 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017623124] [2019-11-15 20:40:04,301 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:04,301 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:40:04,302 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194790954] [2019-11-15 20:40:04,303 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:40:04,303 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:04,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:40:04,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:40:04,303 INFO L87 Difference]: Start difference. First operand 2130 states and 2325 transitions. cyclomatic complexity: 198 Second operand 3 states. [2019-11-15 20:40:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:04,564 INFO L93 Difference]: Finished difference Result 1838 states and 1967 transitions. [2019-11-15 20:40:04,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:40:04,564 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1838 states and 1967 transitions. [2019-11-15 20:40:04,571 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 1833 [2019-11-15 20:40:04,582 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1838 states to 1838 states and 1967 transitions. [2019-11-15 20:40:04,582 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1838 [2019-11-15 20:40:04,584 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1838 [2019-11-15 20:40:04,584 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1838 states and 1967 transitions. [2019-11-15 20:40:04,586 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:04,586 INFO L688 BuchiCegarLoop]: Abstraction has 1838 states and 1967 transitions. [2019-11-15 20:40:04,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states and 1967 transitions. [2019-11-15 20:40:04,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1278. [2019-11-15 20:40:04,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1278 states. [2019-11-15 20:40:04,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1278 states to 1278 states and 1407 transitions. [2019-11-15 20:40:04,608 INFO L711 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-11-15 20:40:04,608 INFO L591 BuchiCegarLoop]: Abstraction has 1278 states and 1407 transitions. [2019-11-15 20:40:04,608 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 20:40:04,609 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1278 states and 1407 transitions. [2019-11-15 20:40:04,611 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1273 [2019-11-15 20:40:04,611 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:04,612 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:04,615 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:04,615 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 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 20:40:04,615 INFO L791 eck$LassoCheckResult]: Stem: 25622#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 25503#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 25504#L606-2 [2019-11-15 20:40:04,616 INFO L793 eck$LassoCheckResult]: Loop: 25504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 26311#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 26309#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 26307#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 26305#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 26303#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 26301#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 26299#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 26297#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 26295#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 26293#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 26289#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 26290#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 26284#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 26280#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 26281#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 26272#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 26273#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 26264#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 26265#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 26256#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 26257#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 26248#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 26249#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 26236#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 26237#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 26224#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 26225#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 25818#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 25635#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 25813#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 25810#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 25807#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 25803#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 25799#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 25795#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 25791#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 25785#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 25780#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 25774#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 25768#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 25763#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 25758#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 25753#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 25748#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 25743#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 25738#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 25732#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 25727#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 25722#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 25717#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 25712#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 25707#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 25702#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 25697#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 25693#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 25688#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 25684#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 25680#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 25676#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 25671#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 25672#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 25821#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 25822#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 25914#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 25909#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 25904#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 25899#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 25894#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 25890#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 25886#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 25882#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 25878#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 25874#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 25870#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 25866#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 25862#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 25858#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 25854#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 25850#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 25846#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 25842#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 25838#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 25834#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 25830#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 25825#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 25826#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 26132#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 26129#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 26126#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 26123#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 26120#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 26117#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 26114#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 26111#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 26108#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 26105#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 26102#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 26099#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 26096#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 26093#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 26090#L394 assume ((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a19~0 := 0;~a28~0 := 7;calculate_output_#res := 25; 25566#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 26313#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 26312#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 26310#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 26308#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 26306#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 26304#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 26302#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 26300#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 26298#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 26296#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 26294#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 26292#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 26287#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 26288#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 26291#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 26276#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 26277#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 26268#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 26269#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 26260#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 26261#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 26252#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 26253#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 26242#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 26243#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 26230#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 26231#L154 assume 1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0;~a25~0 := 1;~a19~0 := 1;~a28~0 := 7;calculate_output_#res := -1; 25772#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 25504#L606-2 [2019-11-15 20:40:04,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:04,616 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2019-11-15 20:40:04,616 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:04,616 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247308288] [2019-11-15 20:40:04,616 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:04,617 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:04,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:04,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:04,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:04,621 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:04,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:04,621 INFO L82 PathProgramCache]: Analyzing trace with hash -645173945, now seen corresponding path program 1 times [2019-11-15 20:40:04,621 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:04,622 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138008850] [2019-11-15 20:40:04,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:04,622 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:04,622 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:04,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-11-15 20:40:04,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138008850] [2019-11-15 20:40:04,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:04,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:40:04,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668238480] [2019-11-15 20:40:04,702 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:40:04,702 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:04,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 20:40:04,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 20:40:04,703 INFO L87 Difference]: Start difference. First operand 1278 states and 1407 transitions. cyclomatic complexity: 133 Second operand 3 states. [2019-11-15 20:40:05,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:05,095 INFO L93 Difference]: Finished difference Result 1841 states and 1970 transitions. [2019-11-15 20:40:05,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 20:40:05,096 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1841 states and 1970 transitions. [2019-11-15 20:40:05,103 INFO L131 ngComponentsAnalysis]: Automaton has 7 accepting balls. 1835 [2019-11-15 20:40:05,120 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1841 states to 1841 states and 1970 transitions. [2019-11-15 20:40:05,120 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1841 [2019-11-15 20:40:05,122 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1841 [2019-11-15 20:40:05,122 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1841 states and 1970 transitions. [2019-11-15 20:40:05,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:05,124 INFO L688 BuchiCegarLoop]: Abstraction has 1841 states and 1970 transitions. [2019-11-15 20:40:05,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1841 states and 1970 transitions. [2019-11-15 20:40:05,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1841 to 1418. [2019-11-15 20:40:05,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1418 states. [2019-11-15 20:40:05,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1418 states to 1418 states and 1541 transitions. [2019-11-15 20:40:05,148 INFO L711 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-11-15 20:40:05,148 INFO L591 BuchiCegarLoop]: Abstraction has 1418 states and 1541 transitions. [2019-11-15 20:40:05,148 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 20:40:05,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1418 states and 1541 transitions. [2019-11-15 20:40:05,151 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 1412 [2019-11-15 20:40:05,151 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:05,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:05,152 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:40:05,152 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:40:05,153 INFO L791 eck$LassoCheckResult]: Stem: 28746#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 28628#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 28629#L606-2 [2019-11-15 20:40:05,154 INFO L793 eck$LassoCheckResult]: Loop: 28629#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 29450#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 29447#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 29444#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 29441#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 29438#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 29435#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 29432#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 29429#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 29426#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 29423#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 29415#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 29416#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 29407#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 29408#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 29399#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 29400#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 29391#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 29392#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 29383#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 29384#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 29375#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 29376#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 29367#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 29368#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29355#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 29356#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 29343#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 29344#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 29413#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 29414#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 29405#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 29406#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 29397#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 29398#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 29389#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 29390#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 29381#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 29382#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 29373#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 29374#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 29363#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 29364#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 29351#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 29352#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 29245#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 29246#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 29359#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 29360#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 29347#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 29348#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 28916#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 28917#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 29711#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 29708#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 29705#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 29702#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 29699#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 29696#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 29693#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 29690#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 29687#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 29684#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 29681#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 29678#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 29675#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 29672#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 29669#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 29666#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 29663#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 29660#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 29657#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 29654#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 29651#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 29648#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 29645#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 29642#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 29639#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29636#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29633#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29630#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29627#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29624#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29621#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29618#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29615#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29612#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29609#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29606#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29603#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29600#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29597#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29594#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29591#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29588#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29585#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29582#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29579#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29576#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29573#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29570#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29567#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29564#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29561#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29558#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29555#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29552#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29549#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29546#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29543#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29540#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29537#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29534#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29531#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29528#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29525#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29522#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29519#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29516#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29513#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29510#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29507#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29504#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29501#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29498#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29495#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29492#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29489#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29486#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29483#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29480#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29477#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29474#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29471#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 29468#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 29465#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29462#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 29459#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 29456#L594-1 calculate_output_#res := -2; 29454#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 28629#L606-2 [2019-11-15 20:40:05,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:05,154 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2019-11-15 20:40:05,154 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:05,155 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823958380] [2019-11-15 20:40:05,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:05,155 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:05,155 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:05,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:05,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:05,159 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:05,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:05,159 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2019-11-15 20:40:05,159 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:05,160 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462902124] [2019-11-15 20:40:05,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:05,160 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:05,160 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:05,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:05,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:05,204 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:05,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:05,238 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2019-11-15 20:40:05,238 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:05,238 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720822970] [2019-11-15 20:40:05,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:05,238 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:05,238 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:40:05,867 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 20:40:05,867 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720822970] [2019-11-15 20:40:05,867 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:40:05,868 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-11-15 20:40:05,868 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820480092] [2019-11-15 20:40:07,016 WARN L191 SmtUtils]: Spent 1.13 s on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2019-11-15 20:40:07,119 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 20:40:07,129 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:40:07,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-15 20:40:07,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-11-15 20:40:07,130 INFO L87 Difference]: Start difference. First operand 1418 states and 1541 transitions. cyclomatic complexity: 128 Second operand 9 states. [2019-11-15 20:40:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:40:07,952 INFO L93 Difference]: Finished difference Result 1330 states and 1452 transitions. [2019-11-15 20:40:07,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-11-15 20:40:07,953 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1330 states and 1452 transitions. [2019-11-15 20:40:07,958 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-11-15 20:40:07,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-11-15 20:40:07,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1330 [2019-11-15 20:40:07,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1330 [2019-11-15 20:40:07,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1330 states and 1452 transitions. [2019-11-15 20:40:07,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:40:07,972 INFO L688 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-11-15 20:40:07,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states and 1452 transitions. [2019-11-15 20:40:08,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2019-11-15 20:40:08,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2019-11-15 20:40:08,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1452 transitions. [2019-11-15 20:40:08,049 INFO L711 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-11-15 20:40:08,049 INFO L591 BuchiCegarLoop]: Abstraction has 1330 states and 1452 transitions. [2019-11-15 20:40:08,049 INFO L424 BuchiCegarLoop]: ======== Iteration 12============ [2019-11-15 20:40:08,049 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1330 states and 1452 transitions. [2019-11-15 20:40:08,052 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1272 [2019-11-15 20:40:08,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:40:08,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:40:08,053 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:40:08,053 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:40:08,053 INFO L791 eck$LassoCheckResult]: Stem: 31519#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 31398#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 31399#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 32229#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 32226#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 32223#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 31441#L597 [2019-11-15 20:40:08,054 INFO L793 eck$LassoCheckResult]: Loop: 31441#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 32483#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 32480#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 32476#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 32472#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 32468#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 32464#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 32457#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 31441#L597 [2019-11-15 20:40:08,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:08,054 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2019-11-15 20:40:08,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:08,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84356302] [2019-11-15 20:40:08,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:08,055 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:08,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:08,064 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:08,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2019-11-15 20:40:08,066 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:08,066 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742191720] [2019-11-15 20:40:08,066 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:08,067 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:08,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:08,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:08,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:08,080 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:08,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:40:08,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2019-11-15 20:40:08,081 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:40:08,081 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578117794] [2019-11-15 20:40:08,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:08,082 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:40:08,082 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:40:08,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:08,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:40:08,096 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:40:08,349 WARN L191 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 65 [2019-11-15 20:40:08,403 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:40:08,403 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:40:08,403 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:40:08,403 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:40:08,403 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2019-11-15 20:40:08,403 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,404 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:40:08,404 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:40:08,404 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label38.c_Iteration12_Lasso [2019-11-15 20:40:08,404 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:40:08,404 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:40:08,406 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 20:40:08,409 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 20:40:08,411 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 20:40:08,413 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 20:40:08,416 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 20:40:08,418 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 20:40:08,421 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 20:40:08,423 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 20:40:08,426 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 20:40:08,429 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 20:40:08,431 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 20:40:08,433 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 20:40:08,436 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 20:40:08,438 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 20:40:08,441 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 20:40:08,444 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:40:08,465 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 20:40:08,467 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 20:40:08,477 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 20:40:08,486 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 20:40:08,490 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 20:40:08,711 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:40:08,711 INFO L404 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 20:40:08,714 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,715 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,717 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,717 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 20:40:08,731 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,731 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,733 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,733 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 20:40:08,744 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,744 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,747 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,747 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,752 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,752 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,755 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,755 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 22 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 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,759 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,759 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,764 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,764 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,770 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,770 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,772 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,773 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,781 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,781 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,783 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,783 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 25 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 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,787 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,787 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,790 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,790 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 20:40:08,801 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,801 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 [2019-11-15 20:40:08,804 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,804 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,808 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,808 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,811 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,811 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 28 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 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,816 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,816 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,818 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,819 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,823 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,823 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,827 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,827 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,833 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,833 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,835 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,835 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 31 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 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,839 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,839 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,842 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,842 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 20:40:08,845 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,845 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:08,848 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:08,848 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/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 20:40:08,855 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:08,855 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 34 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 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:08,865 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:40:08,865 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:09,095 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:09,096 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 15, 13] Nus: [0, 1] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 35 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 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:09,101 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:09,101 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:09,103 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:09,103 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 36 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 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:09,108 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:09,108 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:09,111 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:09,111 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 37 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 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:09,116 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:09,116 INFO L160 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 38 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 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:09,123 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2019-11-15 20:40:09,124 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:09,249 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:09,249 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=18}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=28}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 39 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 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:09,253 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:09,253 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:09,256 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:09,256 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/z3 Starting monitored process 40 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 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:40:09,265 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2019-11-15 20:40:09,265 INFO L160 nArgumentSynthesizer]: Using integer mode. [2019-11-15 20:40:09,267 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2019-11-15 20:40:09,268 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2019-11-15 20:40:09,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:40:09 BoogieIcfgContainer [2019-11-15 20:40:09,294 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:40:09,294 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:40:09,294 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:40:09,295 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:40:09,295 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:53" (3/4) ... [2019-11-15 20:40:09,298 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2019-11-15 20:40:09,340 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_0759cb8d-7da5-462d-83b6-c9b1e1325471/bin/uautomizer/witness.graphml [2019-11-15 20:40:09,341 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:40:09,342 INFO L168 Benchmark]: Toolchain (without parser) took 17624.71 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 494.4 MB). Free memory was 938.0 MB in the beginning and 1.0 GB in the end (delta: -96.4 MB). Peak memory consumption was 398.0 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:09,342 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:40:09,342 INFO L168 Benchmark]: CACSL2BoogieTranslator took 582.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:09,343 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:09,343 INFO L168 Benchmark]: Boogie Preprocessor took 99.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:09,343 INFO L168 Benchmark]: RCFGBuilder took 1296.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:09,344 INFO L168 Benchmark]: BuchiAutomizer took 15517.06 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 992.7 MB in the beginning and 1.0 GB in the end (delta: -45.8 MB). Peak memory consumption was 307.6 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:09,344 INFO L168 Benchmark]: Witness Printer took 46.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:40:09,346 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 962.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 582.57 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 141.0 MB). Free memory was 938.0 MB in the beginning and 1.1 GB in the end (delta: -174.7 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 77.98 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 99.62 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1296.84 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 992.7 MB in the end (delta: 109.3 MB). Peak memory consumption was 109.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 15517.06 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 353.4 MB). Free memory was 992.7 MB in the beginning and 1.0 GB in the end (delta: -45.8 MB). Peak memory consumption was 307.6 MB. Max. memory is 11.5 GB. * Witness Printer took 46.43 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 4.1 MB). Peak memory consumption was 4.1 MB. 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 11 terminating modules (11 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.11 modules have a trivial ranking function, the largest among these consists of 9 locations. The remainder module has 1330 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 15.4s and 12 iterations. TraceHistogramMax:4. Analysis of lassos took 8.0s. Construction of modules took 4.9s. Büchi inclusion checks took 1.6s. Highest rank in rank-based complementation 0. Minimization of det autom 11. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 1975 StatesRemovedByMinimization, 7 NontrivialMinimizations. Non-live state removal took 0.2s Buchi closure took 0.0s. Biggest automaton had 2130 states and ocurred in iteration 8. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1503 SDtfs, 1791 SDslu, 175 SDs, 0 SdLazy, 4260 SolverSat, 739 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.9s Time LassoAnalysisResults: nont1 unkn0 SFLI8 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 172ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.8s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@367e0995=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@338da9d3=0, y=0, x=0, z=0, u=0, w=0, v=0, a=0, c=0, a28=0, \old(input)=0, output=0, a25=0, a21=0, d=0, e=0, f=0, input=0, input=0} State at position 1 is {a19=1, a17=8, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@367e0995=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@338da9d3=1, y=25, x=24, z=26, u=21, w=23, v=22, a=1, c=3, a28=10, \old(input)=6, output=-1, a25=0, a21=1, d=4, e=5, f=6, input=6, input=6} For i>1, the state at position i is {a19=1 + sum_{k=0}^i 0, a17=8 + sum_{k=0}^i 0, \result=0 + sum_{k=0}^i 0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@367e0995=0 + sum_{k=0}^i 0, a11=0 + sum_{k=0}^i 0, \result=22 + sum_{k=0}^i -23*0^k, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@338da9d3=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -5*0^k, output=-1 + sum_{k=0}^i 18*0^k + -23*0^k + -23*k*0^(k-1) + 28*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i -5*0^k, input=6 + sum_{k=0}^i -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 4GEVs Lambdas: [0, 15, 13, 0, 0, 0] Mus: [0, 1, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...