./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fbfe8dec550fadf4da01fadd46005a09263b3b04 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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.23-1dbac8b [2018-10-27 06:09:26,436 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:09:26,438 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:09:26,448 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:09:26,452 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:09:26,453 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:09:26,455 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:09:26,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:09:26,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:09:26,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:09:26,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:09:26,462 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:09:26,463 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:09:26,465 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:09:26,474 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:09:26,475 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:09:26,475 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:09:26,476 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:09:26,478 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:09:26,479 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:09:26,480 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:09:26,481 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:09:26,483 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:09:26,483 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:09:26,483 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:09:26,484 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:09:26,485 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:09:26,490 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:09:26,490 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:09:26,491 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:09:26,491 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:09:26,492 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:09:26,492 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:09:26,492 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:09:26,493 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:09:26,495 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:09:26,496 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-10-27 06:09:26,511 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:09:26,511 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:09:26,511 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:09:26,512 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:09:26,512 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:09:26,512 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:09:26,512 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:09:26,512 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:09:26,512 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:09:26,512 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:09:26,512 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:09:26,513 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:09:26,513 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-27 06:09:26,513 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:09:26,513 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:09:26,513 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-27 06:09:26,517 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:09:26,517 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:09:26,517 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:09:26,517 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:09:26,518 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-27 06:09:26,518 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:09:26,518 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:09:26,518 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:09:26,518 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:09:26,519 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:09:26,519 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:09:26,519 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:09:26,519 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:09:26,519 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:09:26,520 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:09:26,520 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fbfe8dec550fadf4da01fadd46005a09263b3b04 [2018-10-27 06:09:26,552 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:09:26,561 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:09:26,564 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:09:26,566 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:09:26,566 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:09:26,567 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c [2018-10-27 06:09:26,616 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/data/cf6886520/b82266afb52d443e9824eb41b373a6d9/FLAG2cbd451e0 [2018-10-27 06:09:27,065 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:09:27,066 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/sv-benchmarks/c/eca-rers2012/Problem02_label04_true-unreach-call_false-termination.c [2018-10-27 06:09:27,074 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/data/cf6886520/b82266afb52d443e9824eb41b373a6d9/FLAG2cbd451e0 [2018-10-27 06:09:27,086 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/data/cf6886520/b82266afb52d443e9824eb41b373a6d9 [2018-10-27 06:09:27,089 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:09:27,090 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:09:27,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:27,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:09:27,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:09:27,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21fd0115 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27, skipping insertion in model container [2018-10-27 06:09:27,099 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,107 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:09:27,148 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:09:27,558 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:27,562 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:09:27,677 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:09:27,691 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:09:27,692 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27 WrapperNode [2018-10-27 06:09:27,692 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:09:27,693 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:27,693 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:09:27,694 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:09:27,702 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,717 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:09:27,779 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:09:27,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:09:27,780 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:09:27,912 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,923 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,924 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,945 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,974 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (1/1) ... [2018-10-27 06:09:27,984 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:09:27,986 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:09:27,986 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:09:27,986 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:09:27,987 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:28,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:09:28,045 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:09:30,599 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:09:30,600 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:30 BoogieIcfgContainer [2018-10-27 06:09:30,600 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:09:30,601 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:09:30,601 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:09:30,604 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:09:30,604 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:30,604 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:09:27" (1/3) ... [2018-10-27 06:09:30,606 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@479e85ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:30, skipping insertion in model container [2018-10-27 06:09:30,606 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:30,606 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:09:27" (2/3) ... [2018-10-27 06:09:30,607 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@479e85ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:09:30, skipping insertion in model container [2018-10-27 06:09:30,607 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:09:30,607 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:30" (3/3) ... [2018-10-27 06:09:30,608 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label04_true-unreach-call_false-termination.c [2018-10-27 06:09:30,661 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:09:30,662 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:09:30,662 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:09:30,662 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:09:30,662 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:09:30,663 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:09:30,663 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:09:30,663 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:09:30,663 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:09:30,683 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-10-27 06:09:30,713 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-10-27 06:09:30,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:30,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:30,722 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:09:30,722 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:30,722 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:09:30,722 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-10-27 06:09:30,729 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-10-27 06:09:30,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:30,730 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:30,731 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:09:30,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-10-27 06:09:30,739 INFO L793 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~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 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-10-27 06:09:30,739 INFO L795 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-10-27 06:09:30,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:30,746 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-10-27 06:09:30,748 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:30,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:30,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:30,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:30,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:30,844 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-10-27 06:09:30,844 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:30,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:30,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:30,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:30,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:30,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:30,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:30,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-10-27 06:09:30,869 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:30,869 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:30,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:30,870 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:30,870 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:31,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:31,062 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:31,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:09:31,647 WARN L179 SmtUtils]: Spent 577.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-10-27 06:09:31,814 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification that was a NOOP. DAG size: 42 [2018-10-27 06:09:31,822 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:31,823 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:31,823 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:31,823 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:31,823 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:09:31,823 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:31,823 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:31,823 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:31,823 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label04_true-unreach-call_false-termination.c_Iteration1_Loop [2018-10-27 06:09:31,824 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:31,824 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:31,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,955 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:31,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:32,255 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:32,256 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:32,267 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:32,267 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:32,293 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:32,293 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:32,319 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:32,319 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:32,346 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:32,346 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:09:32,488 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:32,489 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:32,534 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:32,535 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:09:32,541 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:32,541 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:32,570 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:32,570 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:32,598 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:32,598 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:32,616 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:32,617 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:09:32,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:32,625 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:32,630 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:32,631 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:09:32,664 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:32,664 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:32,682 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:32,682 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-10-27 06:09:32,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:32,716 INFO L163 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:32,752 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:32,752 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:32,788 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:09:32,789 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:32,789 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:32,789 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:32,790 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:32,790 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:32,790 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:32,790 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:32,790 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:32,790 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label04_true-unreach-call_false-termination.c_Iteration1_Loop [2018-10-27 06:09:32,790 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:32,791 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:32,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:32,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:32,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:32,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:32,863 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:32,882 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:32,884 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:32,889 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:33,250 WARN L179 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-27 06:09:33,706 WARN L179 SmtUtils]: Spent 288.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-27 06:09:33,707 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:33,712 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:33,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,715 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,715 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:33,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:33,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,731 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:33,732 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:33,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,739 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:09:33,739 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:33,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:33,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,766 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:33,769 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:33,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,778 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:33,779 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:33,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,785 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:33,786 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:33,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,791 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,791 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,792 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:33,792 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:33,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,801 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,805 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:33,805 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:33,806 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:33,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,814 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,815 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:09:33,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,827 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:33,828 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:33,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,842 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,844 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:33,845 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:33,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,850 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,851 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:09:33,852 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:33,856 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:09:33,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,875 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,876 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:33,880 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:33,880 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,906 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:33,907 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:33,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,912 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,912 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,913 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:33,914 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:33,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,919 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,920 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:33,921 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:33,921 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,926 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,927 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,927 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,927 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,928 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:33,928 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:33,929 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:33,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,944 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,945 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:09:33,945 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,946 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:33,947 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:33,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,964 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,965 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:33,966 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:33,967 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:33,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:33,970 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:33,971 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:33,971 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:33,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:33,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:33,972 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:09:33,972 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:33,986 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:09:33,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,011 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,012 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,013 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,025 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,026 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,026 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,027 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,027 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,027 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,029 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,032 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,032 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,032 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,032 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,034 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,035 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,036 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,037 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,040 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:34,040 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,041 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:34,041 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,049 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,049 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:09:34,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,050 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,051 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,060 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,063 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,063 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,066 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,067 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:09:34,067 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,068 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:09:34,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,085 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,086 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,086 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,087 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,094 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,095 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,096 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,100 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,102 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,102 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,104 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,105 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,110 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,111 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:34,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,112 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:34,112 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,113 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:09:34,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,120 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,121 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:09:34,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,121 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,122 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,122 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:34,123 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:34,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,140 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,141 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:34,144 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:34,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,147 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,148 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,149 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:09:34,149 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:34,153 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-10-27 06:09:34,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,195 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,199 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,201 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,201 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:34,202 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:34,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,207 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,214 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,215 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,215 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,215 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,215 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,215 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:34,215 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:34,216 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,218 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,219 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,219 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:34,219 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:34,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,234 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,234 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,235 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:34,235 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:34,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,237 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,237 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,243 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:34,243 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:34,243 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,248 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,248 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:09:34,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,252 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:34,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,252 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,254 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,269 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,270 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,270 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:34,270 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,270 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,271 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,271 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,279 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,279 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:34,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,279 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:09:34,279 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,284 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:09:34,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,316 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,319 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,319 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:34,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,320 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,320 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,325 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,328 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,328 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:34,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,328 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,329 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,332 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,333 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:34,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,338 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,339 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,344 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,345 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:34,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,345 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,346 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,347 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,347 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:34,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,348 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:34,348 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,355 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:34,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,363 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:09:34,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,364 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,365 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,370 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,383 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,383 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,386 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,386 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,387 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,394 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,394 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,395 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,395 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:09:34,395 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,403 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-10-27 06:09:34,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,447 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,448 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,448 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,448 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,453 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,462 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,463 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,463 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,463 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,464 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,474 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,475 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,476 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,485 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,486 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,486 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,487 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,488 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:34,488 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,489 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,493 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,493 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,494 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:34,494 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:34,496 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:09:34,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,510 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:09:34,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,511 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,512 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,512 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,529 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,530 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,530 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,530 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,531 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,533 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,533 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,537 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,537 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,538 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:09:34,538 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,539 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:09:34,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,561 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,562 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,562 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,563 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,563 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,572 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,572 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,572 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,573 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,573 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,576 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,578 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,579 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,579 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,579 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,579 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,579 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,585 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,586 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,586 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,587 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,587 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:34,587 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,589 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,593 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,594 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:34,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,594 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:34,594 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:34,595 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:34,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,605 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,605 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:09:34,606 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,606 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,607 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:34,608 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,644 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,645 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,645 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:34,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,651 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,652 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,652 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-10-27 06:09:34,652 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:34,659 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-10-27 06:09:34,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,738 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,739 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,739 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:34,740 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,753 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,756 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:34,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,759 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,760 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:34,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,763 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,763 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:34,763 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:34,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:34,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:34,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:34,768 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:34,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:34,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:34,768 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:34,769 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:34,770 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:09:34,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:34,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:34,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:34,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:34,799 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-10-27 06:09:35,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:35,983 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-10-27 06:09:35,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:35,985 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-10-27 06:09:35,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-10-27 06:09:36,000 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-10-27 06:09:36,001 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-10-27 06:09:36,002 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-10-27 06:09:36,003 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-10-27 06:09:36,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:36,005 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-10-27 06:09:36,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-10-27 06:09:36,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-10-27 06:09:36,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-27 06:09:36,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-10-27 06:09:36,043 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-10-27 06:09:36,043 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-10-27 06:09:36,043 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:09:36,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-10-27 06:09:36,049 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-10-27 06:09:36,049 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:36,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:36,050 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:09:36,050 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:36,050 INFO L793 eck$LassoCheckResult]: Stem: 749#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-10-27 06:09:36,050 INFO L795 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 851#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 734#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 875#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 758#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 695#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 696#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 845#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 633#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-10-27 06:09:36,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:36,051 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-10-27 06:09:36,051 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:36,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:36,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:36,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:36,064 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:36,064 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-10-27 06:09:36,064 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:36,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:36,073 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,074 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:36,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:36,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-10-27 06:09:36,090 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:36,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:36,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:36,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:36,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:36,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-27 06:09:37,229 WARN L179 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 82 DAG size of output: 41 [2018-10-27 06:09:37,250 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:37,250 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:37,250 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:37,250 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:37,250 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:09:37,250 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:37,250 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:37,251 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:37,251 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label04_true-unreach-call_false-termination.c_Iteration2_Loop [2018-10-27 06:09:37,251 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:37,251 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:37,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,558 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:37,559 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:37,628 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:37,628 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:37,650 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:37,650 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:37,656 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:37,656 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:37,660 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:37,660 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:37,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:37,679 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:37,686 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:37,686 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:37,704 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:37,704 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:37,706 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:37,706 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:37,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:37,725 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:37,745 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:37,745 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:37,750 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:37,750 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:37,771 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:37,772 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:37,806 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-10-27 06:09:37,807 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:37,807 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:37,808 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:37,808 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:37,808 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:09:37,808 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:37,808 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:37,808 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:37,808 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label04_true-unreach-call_false-termination.c_Iteration2_Loop [2018-10-27 06:09:37,808 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:37,808 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:37,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,843 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,875 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:37,896 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:38,127 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:38,127 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:09:38,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,128 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,128 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,128 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,137 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,139 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,139 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,139 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,140 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,141 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,141 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,141 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,141 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,142 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,143 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,143 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,143 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,144 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,144 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,144 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,144 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,157 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,158 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,158 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,159 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,160 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,161 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,162 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,162 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,164 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,165 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,165 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,165 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,165 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:09:38,166 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:09:38,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,167 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,167 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-10-27 06:09:38,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,168 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,168 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,169 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:38,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,182 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,183 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,183 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:38,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,185 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,186 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,186 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,186 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,186 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,187 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,188 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:38,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,188 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,201 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,201 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,202 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:38,202 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,203 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,204 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,204 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,204 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,204 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,204 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,206 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,206 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,207 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,207 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,208 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,210 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,211 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,211 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,211 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,211 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,211 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,212 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,212 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:38,212 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,226 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-10-27 06:09:38,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,227 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,228 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,229 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,230 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,230 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,232 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,233 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,233 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,234 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,235 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,235 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,235 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,236 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,249 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,250 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,251 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,252 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,252 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,252 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,254 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,255 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,255 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,256 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,260 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,273 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,274 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,277 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,277 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-10-27 06:09:38,277 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,278 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,278 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:38,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,281 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,281 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:38,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,284 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,284 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,285 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:09:38,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,297 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,298 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,299 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:38,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,299 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,300 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,301 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:38,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,302 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,303 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,303 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,303 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,303 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,303 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,304 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:09:38,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,315 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,316 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,316 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,317 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:09:38,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:09:38,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,323 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,323 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:38,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,339 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-10-27 06:09:38,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,340 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,340 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,341 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:38,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,343 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,343 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,344 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,344 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:38,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,347 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,348 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,348 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,348 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,348 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,348 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,348 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,362 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,363 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,363 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,364 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:38,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,365 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,365 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,366 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:38,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,368 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,368 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,368 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,368 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,386 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,386 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,386 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,386 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,387 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,401 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,402 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,403 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,403 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-10-27 06:09:38,404 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-10-27 06:09:38,404 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,407 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,408 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-10-27 06:09:38,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,408 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,408 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:38,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,409 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,417 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,418 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,420 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,420 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:38,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,421 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,422 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,425 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,434 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,434 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:38,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,434 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,434 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,435 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,436 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,437 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,437 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:38,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,437 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,438 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,439 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,440 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:38,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,440 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,441 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,452 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,452 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:38,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,453 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,453 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,462 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,462 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,467 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,468 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,468 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:38,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,468 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,468 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,472 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,506 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,506 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-10-27 06:09:38,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,507 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,508 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,525 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-10-27 06:09:38,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,526 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,526 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,526 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,527 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:38,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,538 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,539 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,539 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,539 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,540 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:38,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,554 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,554 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,554 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,554 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,555 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:09:38,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,557 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,557 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,568 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,568 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:38,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,570 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,570 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,570 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,571 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:38,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,580 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,581 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,581 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,581 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,583 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:09:38,583 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,599 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,600 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,600 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,600 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,600 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,610 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-10-27 06:09:38,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,627 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,628 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,628 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,628 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-10-27 06:09:38,636 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-10-27 06:09:38,636 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,646 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-10-27 06:09:38,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,647 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,647 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,647 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,647 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,647 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,648 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,649 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,658 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,658 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,658 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,659 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,668 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,668 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,668 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,668 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,668 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,670 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,671 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,671 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,673 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,673 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,685 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,687 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,687 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,688 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,688 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,688 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,692 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,693 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,693 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,693 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,693 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,694 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-10-27 06:09:38,694 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,712 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,712 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,713 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-10-27 06:09:38,713 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,713 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-10-27 06:09:38,714 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-10-27 06:09:38,714 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,719 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,719 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-10-27 06:09:38,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,720 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,720 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,720 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:38,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,730 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,730 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:38,731 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,749 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,749 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,749 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,749 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,749 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:38,750 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:09:38,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,752 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,752 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,752 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,753 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:38,753 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,755 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,755 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,756 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,756 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:38,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,756 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,770 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,771 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,771 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,772 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,772 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:38,773 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:09:38,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,787 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,788 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,788 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,788 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-10-27 06:09:38,788 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:38,790 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-10-27 06:09:38,790 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,820 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-10-27 06:09:38,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-10-27 06:09:38,828 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-10-27 06:09:38,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:09:38,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:09:38,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:09:38,828 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-10-27 06:09:38,829 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:09:38,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:09:38,860 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:09:38,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:38,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:38,861 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-10-27 06:09:39,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:39,628 INFO L93 Difference]: Finished difference Result 660 states and 918 transitions. [2018-10-27 06:09:39,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:39,629 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 918 transitions. [2018-10-27 06:09:39,632 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-10-27 06:09:39,637 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 918 transitions. [2018-10-27 06:09:39,638 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-10-27 06:09:39,639 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-10-27 06:09:39,639 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 918 transitions. [2018-10-27 06:09:39,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:39,641 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:09:39,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 918 transitions. [2018-10-27 06:09:39,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-10-27 06:09:39,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-10-27 06:09:39,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 918 transitions. [2018-10-27 06:09:39,666 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:09:39,666 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 918 transitions. [2018-10-27 06:09:39,666 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:09:39,666 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 918 transitions. [2018-10-27 06:09:39,673 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-10-27 06:09:39,673 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:39,673 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:39,674 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:09:39,674 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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, 1, 1, 1] [2018-10-27 06:09:39,674 INFO L793 eck$LassoCheckResult]: Stem: 1791#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 1673#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1674#L606-3 [2018-10-27 06:09:39,676 INFO L795 eck$LassoCheckResult]: Loop: 1674#L606-3 assume true; 1901#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1774#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1775#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1923#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1685#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2193#L606-3 assume true; 2191#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2189#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2187#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2185#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2183#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2181#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2179#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2177#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2175#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2173#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2171#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2169#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2167#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2165#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2163#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2161#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2159#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2157#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2155#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2153#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2151#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2149#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2147#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2145#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2143#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2141#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2139#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2137#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2135#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2133#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2131#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2129#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2127#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2125#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2123#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2121#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2119#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2117#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2115#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2113#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2111#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2109#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2107#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2105#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2103#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2101#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2099#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2098#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2096#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1815#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1674#L606-3 [2018-10-27 06:09:39,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:39,676 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-10-27 06:09:39,676 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:39,676 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:39,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:39,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:39,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:39,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:39,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:39,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:39,692 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-10-27 06:09:39,692 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:39,692 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:39,693 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:39,693 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:39,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:39,975 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:39,976 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:39,976 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-27 06:09:39,977 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:39,977 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-27 06:09:39,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-27 06:09:39,977 INFO L87 Difference]: Start difference. First operand 660 states and 918 transitions. cyclomatic complexity: 259 Second operand 4 states. [2018-10-27 06:09:41,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:41,098 INFO L93 Difference]: Finished difference Result 1228 states and 1701 transitions. [2018-10-27 06:09:41,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-27 06:09:41,099 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1701 transitions. [2018-10-27 06:09:41,106 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-10-27 06:09:41,112 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1701 transitions. [2018-10-27 06:09:41,113 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-10-27 06:09:41,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-10-27 06:09:41,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1701 transitions. [2018-10-27 06:09:41,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:41,119 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1701 transitions. [2018-10-27 06:09:41,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1701 transitions. [2018-10-27 06:09:41,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-10-27 06:09:41,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-10-27 06:09:41,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1695 transitions. [2018-10-27 06:09:41,147 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-10-27 06:09:41,147 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1695 transitions. [2018-10-27 06:09:41,148 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-10-27 06:09:41,148 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1695 transitions. [2018-10-27 06:09:41,153 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-10-27 06:09:41,156 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:41,156 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:41,159 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:09:41,159 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 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] [2018-10-27 06:09:41,159 INFO L793 eck$LassoCheckResult]: Stem: 3690#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-10-27 06:09:41,159 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4717#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4716#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4714#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4712#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4709#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4708#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4707#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4701#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3590#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4696#L606-3 assume true; 4694#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4692#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4679#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3671#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4677#L606-3 assume true; 4676#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4675#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4674#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4673#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4672#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4671#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4670#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4669#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4668#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4667#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4666#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4665#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4664#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4663#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4662#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4661#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4660#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4659#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4658#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4657#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4656#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4655#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4654#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4653#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 4652#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4651#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 4650#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 4649#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4648#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4647#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4646#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 3840#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 3643#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 3644#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 3674#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4489#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 4488#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4486#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4484#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 4483#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4294#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 4286#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 4279#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4275#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4270#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4265#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4260#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4255#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4250#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4062#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-10-27 06:09:41,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:41,160 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-10-27 06:09:41,160 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:41,160 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:41,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:41,161 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:41,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:41,165 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-10-27 06:09:41,165 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:41,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:41,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,181 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:41,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:41,261 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:09:41,262 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:41,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:09:41,262 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:41,262 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:41,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:41,262 INFO L87 Difference]: Start difference. First operand 1225 states and 1695 transitions. cyclomatic complexity: 472 Second operand 3 states. [2018-10-27 06:09:42,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:42,858 INFO L93 Difference]: Finished difference Result 1509 states and 2004 transitions. [2018-10-27 06:09:42,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:42,859 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2004 transitions. [2018-10-27 06:09:42,867 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-10-27 06:09:42,874 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2004 transitions. [2018-10-27 06:09:42,874 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-10-27 06:09:42,876 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-10-27 06:09:42,876 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2004 transitions. [2018-10-27 06:09:42,880 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:42,880 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2004 transitions. [2018-10-27 06:09:42,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2004 transitions. [2018-10-27 06:09:42,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-10-27 06:09:42,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-10-27 06:09:42,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2002 transitions. [2018-10-27 06:09:42,904 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-10-27 06:09:42,904 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2002 transitions. [2018-10-27 06:09:42,904 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-10-27 06:09:42,904 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2002 transitions. [2018-10-27 06:09:42,913 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:09:42,913 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:42,914 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:42,915 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:09:42,915 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:42,915 INFO L793 eck$LassoCheckResult]: Stem: 6427#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-10-27 06:09:42,915 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7429#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7422#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7415#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7266#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7267#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7641#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7639#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7627#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7628#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7622#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7623#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7700#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7698#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7696#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 6563#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6502#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6428#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6429#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6536#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7236#L606-3 assume true; 7231#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7226#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7221#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6448#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 7350#L606-3 assume true; 7348#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7347#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7346#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7344#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7342#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7341#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7340#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7338#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7336#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7334#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7332#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7330#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7328#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7326#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7324#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7322#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7320#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7318#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 7316#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 7314#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 7312#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 7310#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 7308#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 7306#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 7304#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 7302#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 7300#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 7298#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 7296#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 7294#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 7292#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 7290#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 7288#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 7286#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7284#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 7282#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 7280#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 7278#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 7276#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 7274#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 7272#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 7242#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 7239#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 7234#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 7229#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 7224#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 7219#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 7214#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 7209#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6824#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-10-27 06:09:42,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:42,916 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-10-27 06:09:42,916 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:42,916 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:42,916 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,916 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:42,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:42,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:42,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:42,932 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-10-27 06:09:42,933 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:42,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:42,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,933 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:42,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:42,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:43,003 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-27 06:09:43,003 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:43,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:09:43,003 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:43,003 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:43,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:43,004 INFO L87 Difference]: Start difference. First operand 1508 states and 2002 transitions. cyclomatic complexity: 496 Second operand 3 states. [2018-10-27 06:09:43,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:43,515 INFO L93 Difference]: Finished difference Result 1507 states and 1823 transitions. [2018-10-27 06:09:43,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:43,517 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1823 transitions. [2018-10-27 06:09:43,528 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:09:43,534 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1823 transitions. [2018-10-27 06:09:43,534 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-10-27 06:09:43,535 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-10-27 06:09:43,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1823 transitions. [2018-10-27 06:09:43,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:43,539 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-10-27 06:09:43,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1823 transitions. [2018-10-27 06:09:43,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-10-27 06:09:43,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-10-27 06:09:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1823 transitions. [2018-10-27 06:09:43,563 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-10-27 06:09:43,563 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1823 transitions. [2018-10-27 06:09:43,563 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-10-27 06:09:43,563 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1823 transitions. [2018-10-27 06:09:43,568 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-10-27 06:09:43,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:43,568 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:43,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:09:43,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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, 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] [2018-10-27 06:09:43,574 INFO L793 eck$LassoCheckResult]: Stem: 9452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-10-27 06:09:43,575 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 10189#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 10187#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 10185#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 10183#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 10181#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 10179#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 10177#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 10160#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 10161#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 10155#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 10156#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 10225#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 10223#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 10221#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 10219#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 10217#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 10215#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 10212#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 10213#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 10312#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10310#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10308#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10306#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10304#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10302#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10301#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10299#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10297#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9780#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9676#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9775#L606-3 assume true; 9773#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9771#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9769#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9767#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9765#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9763#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9761#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9759#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9757#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9754#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9752#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9750#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9748#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9746#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9744#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9742#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9740#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9738#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9736#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9734#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9732#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9730#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9728#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9726#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9724#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9722#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9720#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9718#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9716#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9715#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9713#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9711#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9709#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9708#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9707#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9705#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9703#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9701#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9699#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9697#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9695#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9693#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9691#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9689#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9687#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9685#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9683#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9681#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9678#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9679#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-10-27 06:09:43,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:43,575 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-10-27 06:09:43,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:43,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:43,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:43,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:43,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:43,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:43,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:43,592 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-10-27 06:09:43,592 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:43,592 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:43,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:43,593 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:09:43,593 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:43,838 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:43,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:43,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:09:43,841 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:09:43,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:09:43,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:09:43,841 INFO L87 Difference]: Start difference. First operand 1507 states and 1823 transitions. cyclomatic complexity: 318 Second operand 3 states. [2018-10-27 06:09:44,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:44,111 INFO L93 Difference]: Finished difference Result 1496 states and 1779 transitions. [2018-10-27 06:09:44,112 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:09:44,112 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1779 transitions. [2018-10-27 06:09:44,118 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-10-27 06:09:44,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1779 transitions. [2018-10-27 06:09:44,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-10-27 06:09:44,127 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-10-27 06:09:44,127 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1779 transitions. [2018-10-27 06:09:44,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:44,130 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-10-27 06:09:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1779 transitions. [2018-10-27 06:09:44,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-10-27 06:09:44,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-10-27 06:09:44,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1779 transitions. [2018-10-27 06:09:44,156 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-10-27 06:09:44,156 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1779 transitions. [2018-10-27 06:09:44,156 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-10-27 06:09:44,156 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1779 transitions. [2018-10-27 06:09:44,165 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-10-27 06:09:44,165 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:44,165 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:44,166 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-10-27 06:09:44,166 INFO L867 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, 1] [2018-10-27 06:09:44,167 INFO L793 eck$LassoCheckResult]: Stem: 12456#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-10-27 06:09:44,168 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13504#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13502#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13500#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13498#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13496#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13494#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13492#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 13491#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 13490#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13488#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 13486#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 13484#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 13482#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 13480#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 13478#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 13476#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 13474#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 13472#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 13470#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 13468#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 13466#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 13464#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 13462#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 13460#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 13458#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13456#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 13454#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 13452#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 13263#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 13264#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13520#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13518#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13516#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13514#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13512#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13510#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13508#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13506#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13505#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13503#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13501#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13499#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13497#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13495#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13493#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 13262#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 12425#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 12426#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 12427#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13731#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13624#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13397#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13398#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13801#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13797#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13796#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13795#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13794#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13793#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13792#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13791#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 13790#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13789#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12610#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 12511#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 12399#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 12400#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 12508#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 12391#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 12392#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 12389#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 12390#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13623#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 13622#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13621#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13620#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13618#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13616#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13614#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13612#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13610#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13608#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13606#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13604#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13602#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13600#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12354#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13597#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13595#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13593#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13592#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13591#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13589#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13588#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13586#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13584#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12551#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13581#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13579#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13577#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13575#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13573#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13572#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13571#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13570#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13569#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13567#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13565#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13563#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13561#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13559#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13557#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13554#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13552#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13550#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13548#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13546#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13544#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13543#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13542#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13540#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13538#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13536#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13534#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13532#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13531#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13529#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13528#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13527#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13525#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13523#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13522#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13521#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13519#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13517#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13515#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13513#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13511#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13509#L594-1 calculate_output_#res := -2; 13507#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-10-27 06:09:44,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:44,168 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-10-27 06:09:44,168 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:44,169 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:44,181 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:44,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:44,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:44,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:44,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:44,186 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-10-27 06:09:44,186 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:44,186 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:44,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:44,187 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:44,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:44,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:44,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:44,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:44,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-10-27 06:09:44,264 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:44,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:44,265 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:44,265 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:44,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:44,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:09:44,566 WARN L179 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-27 06:09:44,740 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-27 06:09:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:09:44,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:09:44,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-27 06:09:45,981 WARN L179 SmtUtils]: Spent 975.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-10-27 06:09:46,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-27 06:09:46,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-27 06:09:46,058 INFO L87 Difference]: Start difference. First operand 1496 states and 1779 transitions. cyclomatic complexity: 286 Second operand 10 states. [2018-10-27 06:09:46,497 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 29 [2018-10-27 06:09:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:09:47,160 INFO L93 Difference]: Finished difference Result 1688 states and 1968 transitions. [2018-10-27 06:09:47,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-27 06:09:47,161 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1968 transitions. [2018-10-27 06:09:47,165 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-10-27 06:09:47,172 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1968 transitions. [2018-10-27 06:09:47,172 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-10-27 06:09:47,175 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-10-27 06:09:47,175 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1968 transitions. [2018-10-27 06:09:47,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:09:47,177 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1968 transitions. [2018-10-27 06:09:47,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1968 transitions. [2018-10-27 06:09:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-10-27 06:09:47,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-10-27 06:09:47,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1826 transitions. [2018-10-27 06:09:47,199 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1826 transitions. [2018-10-27 06:09:47,199 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1826 transitions. [2018-10-27 06:09:47,199 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-10-27 06:09:47,199 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1826 transitions. [2018-10-27 06:09:47,204 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-10-27 06:09:47,204 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:09:47,204 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:09:47,205 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:47,205 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:09:47,205 INFO L793 eck$LassoCheckResult]: Stem: 15661#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~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; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16849#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16847#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16845#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16843#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15805#L597 [2018-10-27 06:09:47,212 INFO L795 eck$LassoCheckResult]: Loop: 15805#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 17076#L606-3 assume true; 17075#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 17074#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 17073#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 17072#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 17071#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 17070#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 17069#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15805#L597 [2018-10-27 06:09:47,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:47,213 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-10-27 06:09:47,213 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:47,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:47,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:47,214 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:47,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:47,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:47,226 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-10-27 06:09:47,226 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:47,227 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:47,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:47,227 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:47,227 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:47,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:47,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:47,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:09:47,239 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-10-27 06:09:47,239 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:09:47,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:09:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:47,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:09:47,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:09:47,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:47,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:09:47,721 WARN L179 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 32 [2018-10-27 06:09:47,837 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:09:47,838 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:09:47,838 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:09:47,838 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:09:47,838 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-10-27 06:09:47,838 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:47,838 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:09:47,838 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:09:47,838 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label04_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-10-27 06:09:47,838 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:09:47,838 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:09:47,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,996 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:47,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:48,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:09:48,233 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:09:48,234 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,239 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,239 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,244 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,244 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,265 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,265 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,284 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,284 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,289 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,292 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,292 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,317 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,317 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,338 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,338 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,341 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,341 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,363 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,363 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,383 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,383 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,388 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,388 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,393 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,393 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,414 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,414 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,433 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,434 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/z3 Starting monitored process 26 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 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:09:48,440 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,440 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,461 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,461 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,466 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,466 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,469 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,469 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,491 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,492 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,511 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,511 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,515 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,516 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,538 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,538 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,545 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,545 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,553 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,553 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,576 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,576 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,581 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,582 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,602 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,602 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,622 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,622 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,653 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,653 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,679 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:48,679 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,910 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,910 INFO L446 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=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {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}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,929 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,930 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:48,932 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:48,933 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,952 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:48,952 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:48,975 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-10-27 06:09:48,975 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:49,140 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:49,140 INFO L446 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=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:49,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:49,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:49,181 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:49,181 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:49,186 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:49,186 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:49,189 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:49,189 INFO L446 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/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/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 [2018-10-27 06:09:49,210 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-10-27 06:09:49,210 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-10-27 06:09:49,213 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-10-27 06:09:49,213 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-10-27 06:09:49,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:09:49 BoogieIcfgContainer [2018-10-27 06:09:49,259 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:09:49,259 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:09:49,259 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:09:49,260 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:09:49,260 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:09:30" (3/4) ... [2018-10-27 06:09:49,269 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-10-27 06:09:49,317 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fc772f79-09a0-4180-b97e-4232a56452ac/bin-2019/uautomizer/witness.graphml [2018-10-27 06:09:49,317 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:09:49,318 INFO L168 Benchmark]: Toolchain (without parser) took 22228.01 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 467.7 MB). Free memory was 958.5 MB in the beginning and 1.3 GB in the end (delta: -390.0 MB). Peak memory consumption was 77.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:49,318 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:09:49,318 INFO L168 Benchmark]: CACSL2BoogieTranslator took 601.26 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 928.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:49,319 INFO L168 Benchmark]: Boogie Procedure Inliner took 86.35 ms. Allocated memory is still 1.0 GB. Free memory was 928.9 MB in the beginning and 918.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:49,319 INFO L168 Benchmark]: Boogie Preprocessor took 205.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 918.2 MB in the beginning and 1.2 GB in the end (delta: -258.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:49,319 INFO L168 Benchmark]: RCFGBuilder took 2614.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 108.7 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:49,320 INFO L168 Benchmark]: BuchiAutomizer took 18658.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 278.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -290.5 MB). Peak memory consumption was 407.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:49,320 INFO L168 Benchmark]: Witness Printer took 57.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:09:49,331 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 601.26 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 928.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 86.35 ms. Allocated memory is still 1.0 GB. Free memory was 928.9 MB in the beginning and 918.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 205.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 188.7 MB). Free memory was 918.2 MB in the beginning and 1.2 GB in the end (delta: -258.7 MB). Peak memory consumption was 22.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 2614.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 108.7 MB). Peak memory consumption was 108.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 18658.57 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 278.9 MB). Free memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: -290.5 MB). Peak memory consumption was 407.6 MB. Max. memory is 11.5 GB. * Witness Printer took 57.54 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.3 GB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 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 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 18.5s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 11.5s. Construction of modules took 5.2s. Büchi inclusion checks took 1.2s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1468 SDtfs, 3083 SDslu, 488 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.2s Time LassoAnalysisResults: nont1 unkn0 SFLI4 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: 86ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 1.2s - 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@20999a3e=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31f12ddc=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@20999a3e=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31f12ddc=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@20999a3e=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@31f12ddc=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 4 + -4*0^k + -4*k + -5*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*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 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 0, 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)) [L614] CALL calculate_output(input) [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] RET, EXPR calculate_output(input) [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)) [L614] CALL calculate_output(input) [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...