./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label18_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label18_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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 0b1eb39f0e741b958206d9dc54aeed5270272676 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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-635dfa2 [2018-12-01 18:57:45,445 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-01 18:57:45,446 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-01 18:57:45,455 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-01 18:57:45,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-01 18:57:45,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-01 18:57:45,456 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-01 18:57:45,457 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-01 18:57:45,459 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-01 18:57:45,459 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-01 18:57:45,460 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-01 18:57:45,460 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-01 18:57:45,461 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-01 18:57:45,461 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-01 18:57:45,462 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-01 18:57:45,463 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-01 18:57:45,463 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-01 18:57:45,464 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-01 18:57:45,466 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-01 18:57:45,467 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-01 18:57:45,467 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-01 18:57:45,468 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-01 18:57:45,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-01 18:57:45,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-01 18:57:45,470 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-01 18:57:45,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-01 18:57:45,471 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-01 18:57:45,472 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-01 18:57:45,472 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-01 18:57:45,473 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-01 18:57:45,473 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-01 18:57:45,474 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-01 18:57:45,474 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-01 18:57:45,474 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-01 18:57:45,474 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-01 18:57:45,475 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-01 18:57:45,475 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-01 18:57:45,482 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-01 18:57:45,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-01 18:57:45,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-01 18:57:45,484 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-01 18:57:45,484 INFO L133 SettingsManager]: * Use SBE=true [2018-12-01 18:57:45,484 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-01 18:57:45,484 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-01 18:57:45,484 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-01 18:57:45,484 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-01 18:57:45,484 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-01 18:57:45,485 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-01 18:57:45,485 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-01 18:57:45,485 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-01 18:57:45,485 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-01 18:57:45,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-01 18:57:45,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-01 18:57:45,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-01 18:57:45,485 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-01 18:57:45,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-01 18:57:45,486 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-01 18:57:45,486 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-01 18:57:45,486 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-01 18:57:45,486 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-01 18:57:45,486 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-01 18:57:45,486 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-01 18:57:45,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-01 18:57:45,487 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-01 18:57:45,487 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-01 18:57:45,487 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-01 18:57:45,487 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-01 18:57:45,487 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-01 18:57:45,488 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-01 18:57:45,488 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_00b66e0c-c232-4810-b282-3748f904c9dc/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 -> 0b1eb39f0e741b958206d9dc54aeed5270272676 [2018-12-01 18:57:45,511 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-01 18:57:45,518 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-01 18:57:45,520 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-01 18:57:45,521 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-01 18:57:45,521 INFO L276 PluginConnector]: CDTParser initialized [2018-12-01 18:57:45,522 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label18_true-unreach-call_false-termination.c [2018-12-01 18:57:45,558 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/data/9bce1f611/532d86a256494bceb13f03da82ffc9a0/FLAG0e78f6dd4 [2018-12-01 18:57:46,021 INFO L307 CDTParser]: Found 1 translation units. [2018-12-01 18:57:46,021 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/sv-benchmarks/c/eca-rers2012/Problem02_label18_true-unreach-call_false-termination.c [2018-12-01 18:57:46,028 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/data/9bce1f611/532d86a256494bceb13f03da82ffc9a0/FLAG0e78f6dd4 [2018-12-01 18:57:46,037 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/data/9bce1f611/532d86a256494bceb13f03da82ffc9a0 [2018-12-01 18:57:46,039 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-01 18:57:46,039 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-01 18:57:46,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-01 18:57:46,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-01 18:57:46,042 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-01 18:57:46,043 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,044 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a1782ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46, skipping insertion in model container [2018-12-01 18:57:46,044 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,049 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-01 18:57:46,071 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-01 18:57:46,244 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:57:46,247 INFO L191 MainTranslator]: Completed pre-run [2018-12-01 18:57:46,350 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-01 18:57:46,363 INFO L195 MainTranslator]: Completed translation [2018-12-01 18:57:46,363 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46 WrapperNode [2018-12-01 18:57:46,363 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-01 18:57:46,364 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-01 18:57:46,364 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-01 18:57:46,364 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-01 18:57:46,369 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,415 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-01 18:57:46,416 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-01 18:57:46,416 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-01 18:57:46,416 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-01 18:57:46,422 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,422 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,425 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,425 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,438 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,446 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,450 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (1/1) ... [2018-12-01 18:57:46,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-01 18:57:46,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-01 18:57:46,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-01 18:57:46,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-01 18:57:46,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:46,492 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-01 18:57:46,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-01 18:57:47,060 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-01 18:57:47,060 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-01 18:57:47,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:57:47 BoogieIcfgContainer [2018-12-01 18:57:47,061 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-01 18:57:47,061 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-01 18:57:47,061 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-01 18:57:47,064 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-01 18:57:47,065 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:57:47,065 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.12 06:57:46" (1/3) ... [2018-12-01 18:57:47,066 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c5ebd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 06:57:47, skipping insertion in model container [2018-12-01 18:57:47,066 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:57:47,066 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:57:46" (2/3) ... [2018-12-01 18:57:47,066 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3c5ebd21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.12 06:57:47, skipping insertion in model container [2018-12-01 18:57:47,067 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-01 18:57:47,067 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:57:47" (3/3) ... [2018-12-01 18:57:47,068 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label18_true-unreach-call_false-termination.c [2018-12-01 18:57:47,110 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-01 18:57:47,111 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-01 18:57:47,111 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-01 18:57:47,111 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-01 18:57:47,111 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-01 18:57:47,111 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-01 18:57:47,111 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-01 18:57:47,112 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-01 18:57:47,112 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-01 18:57:47,125 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-01 18:57:47,145 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-01 18:57:47,145 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:57:47,145 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:57:47,151 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:57:47,151 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 18:57:47,151 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-01 18:57:47,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-01 18:57:47,155 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-01 18:57:47,155 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:57:47,155 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:57:47,156 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:57:47,156 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-01 18:57:47,161 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-12-01 18:57:47,161 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-12-01 18:57:47,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:47,165 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-01 18:57:47,166 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:47,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:47,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:47,197 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:47,197 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:47,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:47,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:47,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:47,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-12-01 18:57:47,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:47,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:47,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:47,233 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:47,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:47,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:47,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:47,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:47,249 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-12-01 18:57:47,249 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:47,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:47,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:47,249 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:47,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:47,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:57:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:57:47,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:57:47,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 18:57:47,392 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:57:47,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:57:47,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:57:47,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:57:47,393 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 18:57:47,393 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:57:47,393 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:57:47,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:57:47,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label18_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-01 18:57:47,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:57:47,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:57:47,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,447 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,456 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,462 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,629 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:57:47,629 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:47,633 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:47,634 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:47,639 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:47,640 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:47,663 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:47,663 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:47,667 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:47,667 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:57:47,691 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:47,691 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:47,695 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:47,696 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:57:47,719 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:47,719 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:47,721 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:47,721 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:47,736 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:47,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:47,739 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:47,740 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:57:47,755 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:47,755 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:47,758 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:47,758 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:57:47,773 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:47,773 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:47,777 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:47,777 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:57:47,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:47,796 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:47,814 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 18:57:47,814 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:47,835 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 18:57:47,836 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:57:47,836 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:57:47,837 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:57:47,837 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:57:47,837 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:57:47,837 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:57:47,837 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:57:47,837 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:57:47,837 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label18_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-01 18:57:47,837 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:57:47,837 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:57:47,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,847 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,908 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,910 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:47,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:48,022 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:57:48,026 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:57:48,027 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-12-01 18:57:48,028 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,028 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:48,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:48,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,036 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-12-01 18:57:48,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:48,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:48,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,040 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-12-01 18:57:48,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,040 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-01 18:57:48,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:48,042 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:48,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,054 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-12-01 18:57:48,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:48,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:48,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,059 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-12-01 18:57:48,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,060 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:48,060 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:48,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,062 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,062 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-12-01 18:57:48,062 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,063 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,063 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,063 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:48,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:48,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,065 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-12-01 18:57:48,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:48,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:48,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,067 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-12-01 18:57:48,068 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,068 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,068 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,068 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:48,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:48,069 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,072 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-01 18:57:48,072 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-12-01 18:57:48,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,073 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,074 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,079 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-12-01 18:57:48,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,080 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,080 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,080 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,083 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-12-01 18:57:48,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,083 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-01 18:57:48,084 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,085 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-01 18:57:48,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,095 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-12-01 18:57:48,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,096 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,096 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,099 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-12-01 18:57:48,099 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,100 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,100 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,102 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-12-01 18:57:48,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,103 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,103 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,105 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-12-01 18:57:48,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,106 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,106 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,107 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-12-01 18:57:48,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,108 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:48,108 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,109 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:48,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,112 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-01 18:57:48,112 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-12-01 18:57:48,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,113 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,114 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,118 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-12-01 18:57:48,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,119 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,120 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,122 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-12-01 18:57:48,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,122 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-01 18:57:48,123 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,124 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 18:57:48,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,132 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-12-01 18:57:48,132 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,133 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,133 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,136 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-12-01 18:57:48,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,137 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,137 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,139 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-12-01 18:57:48,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,140 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,140 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,140 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,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-12-01 18:57:48,142 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,143 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,143 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,144 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-12-01 18:57:48,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,144 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,145 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:48,145 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,145 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:48,146 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,148 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-01 18:57:48,149 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-12-01 18:57:48,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,149 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,150 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,155 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-12-01 18:57:48,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,155 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,156 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,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-12-01 18:57:48,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,159 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-01 18:57:48,159 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,160 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-01 18:57:48,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,168 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,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-12-01 18:57:48,169 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,169 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,169 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,169 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,169 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,170 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,173 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-12-01 18:57:48,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,173 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,174 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,176 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-12-01 18:57:48,176 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,176 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,176 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,176 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,176 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,177 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,177 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,179 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-12-01 18:57:48,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,180 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,180 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,181 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-12-01 18:57:48,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:48,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,182 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:48,182 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,183 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 18:57:48,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,186 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-01 18:57:48,186 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-12-01 18:57:48,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,187 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,187 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,188 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,188 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,196 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-12-01 18:57:48,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,196 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,197 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,197 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,197 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,198 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,200 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,200 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-12-01 18:57:48,200 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,200 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,201 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-01 18:57:48,201 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,202 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-01 18:57:48,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,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-12-01 18:57:48,219 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,219 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,219 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,219 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,219 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,220 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,223 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,223 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-12-01 18:57:48,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,224 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,224 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,224 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,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-12-01 18:57:48,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,227 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,228 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,228 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,230 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-12-01 18:57:48,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,231 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,231 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,231 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:48,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,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-12-01 18:57:48,233 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,233 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,233 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:48,233 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:48,234 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:48,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,238 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-01 18:57:48,238 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-12-01 18:57:48,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,239 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:48,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,239 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,240 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,241 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,248 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-12-01 18:57:48,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,248 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:48,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,249 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,249 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,252 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-12-01 18:57:48,252 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,253 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:48,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,253 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-01 18:57:48,253 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,255 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 18:57:48,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,272 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-12-01 18:57:48,272 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,272 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:48,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,273 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,274 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,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-12-01 18:57:48,278 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,278 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:48,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,278 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,279 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,281 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-12-01 18:57:48,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,282 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:48,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,282 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,283 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,285 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-12-01 18:57:48,286 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,286 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:48,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,286 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,287 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,288 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-12-01 18:57:48,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,289 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:48,289 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,289 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:48,289 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,290 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:48,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,295 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,295 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-01 18:57:48,295 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-12-01 18:57:48,296 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,296 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,296 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,296 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,298 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,305 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-12-01 18:57:48,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,306 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,306 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,307 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,310 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,310 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-12-01 18:57:48,311 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,311 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,311 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-01 18:57:48,311 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,315 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-01 18:57:48,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,337 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-12-01 18:57:48,337 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,337 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,338 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,339 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,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-12-01 18:57:48,344 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,344 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,344 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,345 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,349 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-12-01 18:57:48,349 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,349 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,350 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,350 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,354 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-12-01 18:57:48,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,355 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,355 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,356 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:48,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,357 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-12-01 18:57:48,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,357 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,358 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:48,358 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:48,360 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 18:57:48,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,366 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-01 18:57:48,366 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-12-01 18:57:48,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,367 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,367 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,368 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,375 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-12-01 18:57:48,375 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,375 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,376 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,378 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-12-01 18:57:48,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,379 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,379 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-01 18:57:48,379 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,380 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 18:57:48,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,391 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-12-01 18:57:48,391 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,392 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,392 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,392 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,396 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-12-01 18:57:48,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,396 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,397 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,397 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,399 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-12-01 18:57:48,399 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,399 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,400 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,400 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,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-12-01 18:57:48,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,402 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,403 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,403 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:48,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,405 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-12-01 18:57:48,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,405 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:48,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,405 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:48,405 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:48,406 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:48,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,411 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-01 18:57:48,411 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-12-01 18:57:48,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,411 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,412 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:48,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:48,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,431 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-12-01 18:57:48,431 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,431 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,432 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:48,432 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:48,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,435 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-12-01 18:57:48,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,435 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,436 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-01 18:57:48,436 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:48,438 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-12-01 18:57:48,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,483 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-12-01 18:57:48,484 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,484 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,484 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:48,485 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:48,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,491 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-12-01 18:57:48,491 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,491 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,491 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:48,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:48,492 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,495 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-12-01 18:57:48,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,495 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,496 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:48,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:48,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,499 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-12-01 18:57:48,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,500 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:48,500 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:48,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:48,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,504 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-12-01 18:57:48,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:48,504 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:48,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:48,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:48,505 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:48,505 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:48,506 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 18:57:48,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:48,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:48,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:57:48,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:57:48,523 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-12-01 18:57:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:57:48,990 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-12-01 18:57:48,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:57:48,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-12-01 18:57:48,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-12-01 18:57:48,999 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-12-01 18:57:48,999 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-12-01 18:57:49,000 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-12-01 18:57:49,001 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-12-01 18:57:49,002 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:57:49,002 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-12-01 18:57:49,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-12-01 18:57:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-12-01 18:57:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-01 18:57:49,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-12-01 18:57:49,026 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-01 18:57:49,026 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-01 18:57:49,026 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-01 18:57:49,026 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-12-01 18:57:49,028 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-12-01 18:57:49,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:57:49,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:57:49,028 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:57:49,028 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:57:49,028 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2018-12-01 18:57:49,028 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2018-12-01 18:57:49,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:49,028 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-01 18:57:49,029 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:49,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:49,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:49,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:49,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:49,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:49,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:49,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:49,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-12-01 18:57:49,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:49,034 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:49,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:49,035 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:57:49,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:49,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:49,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:49,045 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-12-01 18:57:49,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:49,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:49,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:49,045 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:49,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:49,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:57:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:57:49,056 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:57:49,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-01 18:57:49,143 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:57:49,143 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:57:49,143 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:57:49,143 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:57:49,144 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 18:57:49,144 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:57:49,144 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:57:49,144 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:57:49,144 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label18_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-01 18:57:49,144 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:57:49,144 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:57:49,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,240 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:57:49,240 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:49,242 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:49,242 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:49,245 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:49,246 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:49,261 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:49,261 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:49,264 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:49,264 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:49,279 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:49,279 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:49,282 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:49,282 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:49,296 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:49,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:49,298 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:49,298 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:49,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:49,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:49,315 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:49,316 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:49,331 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:49,331 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:49,348 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 18:57:49,348 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:49,369 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-01 18:57:49,371 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:57:49,371 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:57:49,371 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:57:49,371 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:57:49,371 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-01 18:57:49,371 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:57:49,371 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:57:49,371 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:57:49,371 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label18_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-01 18:57:49,371 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:57:49,371 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:57:49,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,375 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:49,499 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:57:49,499 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-01 18:57:49,499 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-12-01 18:57:49,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,499 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:49,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:49,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,501 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-12-01 18:57:49,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,501 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:49,501 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,502 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-12-01 18:57:49,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,502 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:49,503 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:49,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,503 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-12-01 18:57:49,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:49,504 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:49,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,504 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-12-01 18:57:49,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,505 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:49,505 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,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-12-01 18:57:49,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,507 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:49,507 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,509 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-12-01 18:57:49,509 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:49,510 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:49,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,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-12-01 18:57:49,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-01 18:57:49,511 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-01 18:57:49,511 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,512 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,512 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-01 18:57:49,512 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-12-01 18:57:49,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,513 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,513 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:49,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,513 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-12-01 18:57:49,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,514 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,514 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,515 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-12-01 18:57:49,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,515 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,515 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,515 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:49,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,516 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-12-01 18:57:49,516 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,516 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,516 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:49,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,517 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-12-01 18:57:49,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,517 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,518 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,518 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,519 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-12-01 18:57:49,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,520 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,520 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,520 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,520 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,523 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-12-01 18:57:49,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,524 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:49,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,526 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-12-01 18:57:49,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,527 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,527 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:49,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,528 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-01 18:57:49,528 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-12-01 18:57:49,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,529 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,530 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-12-01 18:57:49,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,530 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,530 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,531 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:49,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,531 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-12-01 18:57:49,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,532 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,532 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,532 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-12-01 18:57:49,533 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,533 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,533 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,533 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,534 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-12-01 18:57:49,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,534 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,534 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,535 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:49,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,536 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-12-01 18:57:49,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,537 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,537 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,538 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:49,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,541 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-12-01 18:57:49,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,542 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,542 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,544 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-12-01 18:57:49,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,545 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,545 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,546 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-01 18:57:49,546 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-12-01 18:57:49,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,547 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,547 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:49,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,548 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-12-01 18:57:49,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,548 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,548 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,549 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 18:57:49,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,549 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-12-01 18:57:49,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,550 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,550 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:49,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,550 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-12-01 18:57:49,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,551 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,551 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:49,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,552 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,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-12-01 18:57:49,553 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,553 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,553 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,553 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,553 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 18:57:49,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,555 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,555 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-12-01 18:57:49,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,556 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,556 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,556 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 18:57:49,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,559 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,559 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-12-01 18:57:49,560 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,560 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,560 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,560 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:49,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,562 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,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-12-01 18:57:49,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-01 18:57:49,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,563 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,563 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:49,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,565 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-01 18:57:49,565 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-12-01 18:57:49,565 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,566 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,566 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,566 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:49,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,567 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-12-01 18:57:49,568 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,568 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,568 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,568 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,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-12-01 18:57:49,570 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,570 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,570 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,570 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:49,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,571 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-12-01 18:57:49,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,571 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,572 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,572 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:49,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,573 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-12-01 18:57:49,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,573 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,573 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,573 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,576 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-12-01 18:57:49,576 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,576 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,576 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,576 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,576 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,581 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-12-01 18:57:49,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,581 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,581 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,582 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:49,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,585 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-12-01 18:57:49,585 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,586 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,586 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,586 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-01 18:57:49,586 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-01 18:57:49,586 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,587 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,587 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-01 18:57:49,588 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-12-01 18:57:49,588 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,588 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:49,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,588 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,589 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,589 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,590 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-12-01 18:57:49,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,591 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:49,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,591 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,591 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,591 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:49,591 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,592 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-12-01 18:57:49,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,592 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:49,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,593 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,593 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,594 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-12-01 18:57:49,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,594 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:49,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,594 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,595 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,596 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-12-01 18:57:49,596 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,596 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:49,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,597 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,597 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,597 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:49,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,600 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-12-01 18:57:49,601 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,601 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:49,601 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,601 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,601 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,602 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:49,602 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,609 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,609 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-12-01 18:57:49,610 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,610 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:49,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,610 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,611 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,614 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,615 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-12-01 18:57:49,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,615 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-01 18:57:49,615 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,615 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,615 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,616 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,616 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,616 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,618 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,619 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-01 18:57:49,619 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-12-01 18:57:49,619 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,619 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,619 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,619 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,619 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,620 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,620 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:49,620 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,623 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-12-01 18:57:49,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,623 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,624 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,624 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,624 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 18:57:49,625 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,625 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-12-01 18:57:49,626 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,626 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,626 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,627 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:49,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,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-12-01 18:57:49,628 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,628 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,628 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,628 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,628 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,628 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:49,629 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,631 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-12-01 18:57:49,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,632 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,632 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,632 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,634 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 18:57:49,634 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,642 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-12-01 18:57:49,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,642 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,643 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,643 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,644 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-01 18:57:49,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,655 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-12-01 18:57:49,655 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,655 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,655 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,657 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:49,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,663 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,663 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-12-01 18:57:49,663 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,664 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,664 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-01 18:57:49,665 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-01 18:57:49,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,668 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-01 18:57:49,668 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-12-01 18:57:49,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,669 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,669 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,669 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,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-12-01 18:57:49,670 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,670 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,671 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,671 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,671 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:49,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,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-12-01 18:57:49,672 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,672 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,673 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,673 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,674 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-12-01 18:57:49,675 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,675 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,675 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,675 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,675 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,677 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-12-01 18:57:49,677 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,677 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,677 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,677 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,678 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:49,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,681 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,681 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-12-01 18:57:49,681 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,681 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,682 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,682 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,682 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-01 18:57:49,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,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-12-01 18:57:49,687 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,687 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,688 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,688 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,739 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-12-01 18:57:49,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,739 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-01 18:57:49,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,740 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-01 18:57:49,740 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-01 18:57:49,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,743 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-01 18:57:49,744 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-12-01 18:57:49,744 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,744 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,744 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:49,745 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,747 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-12-01 18:57:49,747 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,748 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,748 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,748 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:49,748 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 18:57:49,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,750 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-12-01 18:57:49,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,751 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,751 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:49,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,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-12-01 18:57:49,754 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,754 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,754 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:49,755 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,757 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-12-01 18:57:49,757 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,757 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,758 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,758 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:49,759 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 18:57:49,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,769 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-12-01 18:57:49,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,769 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,770 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-01 18:57:49,770 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:49,771 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-01 18:57:49,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,786 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,786 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-12-01 18:57:49,787 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,787 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,787 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,787 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,787 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,787 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:49,788 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,788 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,802 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,802 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-12-01 18:57:49,802 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-01 18:57:49,803 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-01 18:57:49,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-01 18:57:49,803 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-01 18:57:49,803 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-01 18:57:49,803 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-01 18:57:49,804 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-01 18:57:49,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-01 18:57:49,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-01 18:57:49,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:57:49,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:57:49,809 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-12-01 18:57:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:57:50,084 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-12-01 18:57:50,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:57:50,085 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-12-01 18:57:50,087 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-01 18:57:50,090 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-12-01 18:57:50,090 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-12-01 18:57:50,091 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-12-01 18:57:50,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-12-01 18:57:50,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:57:50,093 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-01 18:57:50,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-12-01 18:57:50,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-12-01 18:57:50,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-12-01 18:57:50,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-12-01 18:57:50,110 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-01 18:57:50,110 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-01 18:57:50,110 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-01 18:57:50,110 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-12-01 18:57:50,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-01 18:57:50,113 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:57:50,113 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:57:50,114 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:57:50,114 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:57:50,114 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2018-12-01 18:57:50,115 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2018-12-01 18:57:50,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:50,116 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-01 18:57:50,116 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:50,116 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:50,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:50,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:50,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:50,120 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-12-01 18:57:50,120 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:50,121 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:50,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,121 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:57:50,121 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:57:50,167 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:57:50,168 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:57:50,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-01 18:57:50,168 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:57:50,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-01 18:57:50,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-01 18:57:50,168 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-12-01 18:57:50,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:57:50,627 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-12-01 18:57:50,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-01 18:57:50,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-12-01 18:57:50,632 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-12-01 18:57:50,634 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-12-01 18:57:50,635 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-12-01 18:57:50,636 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-12-01 18:57:50,636 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-12-01 18:57:50,637 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:57:50,637 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-12-01 18:57:50,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-12-01 18:57:50,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-12-01 18:57:50,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-12-01 18:57:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-12-01 18:57:50,649 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-01 18:57:50,649 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-01 18:57:50,649 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-01 18:57:50,649 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-12-01 18:57:50,653 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-12-01 18:57:50,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:57:50,653 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:57:50,655 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:57:50,655 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:57:50,655 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2018-12-01 18:57:50,655 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2018-12-01 18:57:50,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:50,656 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-01 18:57:50,656 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:50,656 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:50,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,657 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:50,657 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:50,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:50,660 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-12-01 18:57:50,660 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:50,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:50,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,661 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:57:50,661 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:57:50,680 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 18:57:50,681 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:57:50,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:57:50,681 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:57:50,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:57:50,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:57:50,681 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-12-01 18:57:50,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:57:50,966 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-12-01 18:57:50,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:57:50,967 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-12-01 18:57:50,970 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-01 18:57:50,972 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-01 18:57:50,972 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-12-01 18:57:50,973 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-12-01 18:57:50,973 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-12-01 18:57:50,974 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:57:50,974 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-01 18:57:50,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-12-01 18:57:50,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-12-01 18:57:50,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-12-01 18:57:50,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-01 18:57:50,984 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-01 18:57:50,984 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-01 18:57:50,984 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-01 18:57:50,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-12-01 18:57:50,987 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-01 18:57:50,987 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:57:50,987 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:57:50,988 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:57:50,988 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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-12-01 18:57:50,988 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2018-12-01 18:57:50,988 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2018-12-01 18:57:50,988 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:50,988 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-12-01 18:57:50,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:50,989 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:50,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:50,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:50,991 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-12-01 18:57:50,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:50,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:50,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,992 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:57:50,992 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:57:51,006 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-01 18:57:51,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:57:51,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:57:51,006 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:57:51,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:57:51,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:57:51,006 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-12-01 18:57:51,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:57:51,268 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-12-01 18:57:51,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:57:51,268 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-12-01 18:57:51,271 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-01 18:57:51,273 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-01 18:57:51,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-12-01 18:57:51,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-12-01 18:57:51,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-12-01 18:57:51,275 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:57:51,275 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-01 18:57:51,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-12-01 18:57:51,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-12-01 18:57:51,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-12-01 18:57:51,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-01 18:57:51,284 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-01 18:57:51,284 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-01 18:57:51,284 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-01 18:57:51,284 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-12-01 18:57:51,287 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-01 18:57:51,287 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:57:51,287 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:57:51,288 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:57:51,288 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:57:51,288 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2018-12-01 18:57:51,288 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2018-12-01 18:57:51,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:51,288 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-12-01 18:57:51,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:51,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:51,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:51,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:51,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:51,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:51,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:51,291 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-12-01 18:57:51,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:51,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:51,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:51,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-01 18:57:51,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:51,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:57:51,322 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:57:51,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:57:51,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-01 18:57:51,323 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-01 18:57:51,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-01 18:57:51,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-01 18:57:51,323 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-12-01 18:57:51,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:57:51,469 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-12-01 18:57:51,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-01 18:57:51,470 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-12-01 18:57:51,473 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-01 18:57:51,475 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-01 18:57:51,475 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-12-01 18:57:51,476 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-12-01 18:57:51,476 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-12-01 18:57:51,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:57:51,477 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-01 18:57:51,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-12-01 18:57:51,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-12-01 18:57:51,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-12-01 18:57:51,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-01 18:57:51,486 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-01 18:57:51,486 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-01 18:57:51,486 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-01 18:57:51,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-12-01 18:57:51,488 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-01 18:57:51,488 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:57:51,488 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:57:51,489 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-01 18:57:51,489 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] [2018-12-01 18:57:51,489 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2018-12-01 18:57:51,490 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2018-12-01 18:57:51,490 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:51,490 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-12-01 18:57:51,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:51,490 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:51,490 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:51,490 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:51,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:51,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:51,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:51,493 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-12-01 18:57:51,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:51,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:51,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:51,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:51,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:51,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-12-01 18:57:51,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:51,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:51,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:51,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-01 18:57:51,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-01 18:57:51,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-01 18:57:51,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-01 18:57:52,431 WARN L180 SmtUtils]: Spent 626.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-12-01 18:57:52,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-01 18:57:52,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-01 18:57:52,492 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-12-01 18:57:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-01 18:57:52,902 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-12-01 18:57:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-01 18:57:52,902 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-12-01 18:57:52,905 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-01 18:57:52,907 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-12-01 18:57:52,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-12-01 18:57:52,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-12-01 18:57:52,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-12-01 18:57:52,910 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-01 18:57:52,910 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-01 18:57:52,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-12-01 18:57:52,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-12-01 18:57:52,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-01 18:57:52,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-12-01 18:57:52,919 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-01 18:57:52,919 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-01 18:57:52,920 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-01 18:57:52,920 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-12-01 18:57:52,923 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-01 18:57:52,923 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-01 18:57:52,923 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-01 18:57:52,923 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-01 18:57:52,923 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-01 18:57:52,924 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2018-12-01 18:57:52,924 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2018-12-01 18:57:52,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:52,924 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-12-01 18:57:52,924 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:52,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:52,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:52,925 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:52,925 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:52,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:52,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:52,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-12-01 18:57:52,930 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:52,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:52,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:52,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:52,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:52,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:52,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:52,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-01 18:57:52,935 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-12-01 18:57:52,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-01 18:57:52,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-01 18:57:52,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:52,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-01 18:57:52,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-01 18:57:52,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-01 18:57:53,084 INFO L216 LassoAnalysis]: Preferences: [2018-12-01 18:57:53,084 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-01 18:57:53,084 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-01 18:57:53,084 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-01 18:57:53,084 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-01 18:57:53,084 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-01 18:57:53,084 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-01 18:57:53,084 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-01 18:57:53,084 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label18_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-12-01 18:57:53,084 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-01 18:57:53,084 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-01 18:57:53,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-01 18:57:53,243 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-01 18:57:53,243 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,245 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,245 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,247 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,247 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,262 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,262 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,264 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,264 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,280 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,280 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,281 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,281 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,297 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,297 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,299 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,299 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,314 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,314 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,316 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,316 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,332 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,332 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,334 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,334 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,349 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,349 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,351 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,351 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,366 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,366 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,368 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,368 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,383 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,383 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,385 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,385 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,400 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,400 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,402 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,402 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,417 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,419 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,419 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,434 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,434 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,436 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,436 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,451 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,451 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,453 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,453 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,468 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,468 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,469 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,470 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,484 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,484 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,486 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,486 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,500 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,518 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 18:57:53,518 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,666 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,666 INFO L448 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=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,681 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,681 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,683 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,684 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,698 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,698 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,705 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,705 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,720 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,720 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,737 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-01 18:57:53,737 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,871 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,872 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,886 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,887 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,888 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,888 INFO L448 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_00b66e0c-c232-4810-b282-3748f904c9dc/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-12-01 18:57:53,903 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-01 18:57:53,903 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-01 18:57:53,905 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-01 18:57:53,905 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-12-01 18:57:53,935 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.12 06:57:53 BoogieIcfgContainer [2018-12-01 18:57:53,935 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-01 18:57:53,935 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-01 18:57:53,935 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-01 18:57:53,935 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-01 18:57:53,935 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:57:47" (3/4) ... [2018-12-01 18:57:53,937 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-01 18:57:53,964 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_00b66e0c-c232-4810-b282-3748f904c9dc/bin-2019/uautomizer/witness.graphml [2018-12-01 18:57:53,964 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-01 18:57:53,965 INFO L168 Benchmark]: Toolchain (without parser) took 7925.88 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 483.4 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -153.5 MB). Peak memory consumption was 329.9 MB. Max. memory is 11.5 GB. [2018-12-01 18:57:53,965 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:57:53,965 INFO L168 Benchmark]: CACSL2BoogieTranslator took 323.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. [2018-12-01 18:57:53,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 51.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 18:57:53,966 INFO L168 Benchmark]: Boogie Preprocessor took 39.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-01 18:57:53,966 INFO L168 Benchmark]: RCFGBuilder took 605.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 971.1 MB in the end (delta: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. [2018-12-01 18:57:53,966 INFO L168 Benchmark]: BuchiAutomizer took 6873.36 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 378.5 MB). Free memory was 971.1 MB in the beginning and 1.1 GB in the end (delta: -127.6 MB). Peak memory consumption was 367.9 MB. Max. memory is 11.5 GB. [2018-12-01 18:57:53,966 INFO L168 Benchmark]: Witness Printer took 29.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-01 18:57:53,968 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 976.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 323.65 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 104.9 MB). Free memory was 945.3 MB in the beginning and 1.1 GB in the end (delta: -147.9 MB). Peak memory consumption was 32.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 51.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.45 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 605.56 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 971.1 MB in the end (delta: 111.3 MB). Peak memory consumption was 111.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6873.36 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 378.5 MB). Free memory was 971.1 MB in the beginning and 1.1 GB in the end (delta: -127.6 MB). Peak memory consumption was 367.9 MB. Max. memory is 11.5 GB. * Witness Printer took 29.44 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 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 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.8s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 4.2s. Construction of modules took 1.6s. Büchi inclusion checks took 0.6s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s 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: 48ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - 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@653f7c3a=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4270c8f1=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@653f7c3a=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4270c8f1=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@653f7c3a=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@4270c8f1=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 -6*0^k + 1*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 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 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)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...