./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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 5360c3d4aebe9582cd01259f723ea710f280bf1f ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:52:29,416 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:52:29,417 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:52:29,424 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:52:29,424 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:52:29,425 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:52:29,425 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:52:29,426 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:52:29,427 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:52:29,428 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:52:29,429 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:52:29,429 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:52:29,429 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:52:29,430 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:52:29,432 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:52:29,433 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:52:29,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:52:29,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:52:29,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:52:29,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:52:29,437 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:52:29,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:52:29,440 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:52:29,440 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:52:29,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:52:29,441 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:52:29,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:52:29,442 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:52:29,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:52:29,443 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:52:29,443 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:52:29,444 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:52:29,444 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:52:29,444 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:52:29,445 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:52:29,445 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:52:29,445 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 06:52:29,455 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:52:29,455 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:52:29,456 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 06:52:29,456 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 06:52:29,456 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 06:52:29,457 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 06:52:29,457 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 06:52:29,457 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 06:52:29,457 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 06:52:29,457 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 06:52:29,457 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 06:52:29,457 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:52:29,457 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:52:29,458 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 06:52:29,458 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:52:29,458 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:52:29,458 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:52:29,458 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 06:52:29,458 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 06:52:29,458 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 06:52:29,458 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:52:29,459 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:52:29,459 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 06:52:29,459 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 06:52:29,459 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:52:29,459 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:52:29,459 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 06:52:29,459 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:52:29,460 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 06:52:29,460 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 06:52:29,460 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 06:52:29,460 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_0f5b499d-6720-4833-a97a-02768733dba2/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 -> 5360c3d4aebe9582cd01259f723ea710f280bf1f [2018-11-10 06:52:29,482 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:52:29,491 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:52:29,493 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:52:29,494 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:52:29,494 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:52:29,495 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c [2018-11-10 06:52:29,531 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/data/6b38e6a91/8de6ca2bc0974b69adb6301fff095db0/FLAG1c5a24059 [2018-11-10 06:52:29,977 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:52:29,977 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/sv-benchmarks/c/eca-rers2012/Problem02_label20_true-unreach-call_false-termination.c [2018-11-10 06:52:29,986 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/data/6b38e6a91/8de6ca2bc0974b69adb6301fff095db0/FLAG1c5a24059 [2018-11-10 06:52:29,997 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/data/6b38e6a91/8de6ca2bc0974b69adb6301fff095db0 [2018-11-10 06:52:30,000 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:52:30,001 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:52:30,002 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:52:30,002 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:52:30,005 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:52:30,006 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:29" (1/1) ... [2018-11-10 06:52:30,008 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4eeb45d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30, skipping insertion in model container [2018-11-10 06:52:30,008 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:52:29" (1/1) ... [2018-11-10 06:52:30,016 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:52:30,052 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:52:30,279 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:52:30,282 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:52:30,345 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:52:30,356 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:52:30,357 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30 WrapperNode [2018-11-10 06:52:30,357 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:52:30,357 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:52:30,357 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:52:30,357 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:52:30,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2018-11-10 06:52:30,373 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2018-11-10 06:52:30,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:52:30,476 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:52:30,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:52:30,476 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:52:30,482 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2018-11-10 06:52:30,482 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2018-11-10 06:52:30,485 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2018-11-10 06:52:30,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2018-11-10 06:52:30,498 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2018-11-10 06:52:30,507 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2018-11-10 06:52:30,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... [2018-11-10 06:52:30,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:52:30,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:52:30,517 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:52:30,517 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:52:30,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:30,570 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:52:30,570 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:52:31,381 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:52:31,381 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:52:31 BoogieIcfgContainer [2018-11-10 06:52:31,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:52:31,382 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 06:52:31,382 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 06:52:31,385 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 06:52:31,385 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:52:31,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 06:52:29" (1/3) ... [2018-11-10 06:52:31,386 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c49e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:52:31, skipping insertion in model container [2018-11-10 06:52:31,386 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:52:31,386 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:52:30" (2/3) ... [2018-11-10 06:52:31,387 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5c49e88b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 06:52:31, skipping insertion in model container [2018-11-10 06:52:31,387 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 06:52:31,387 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:52:31" (3/3) ... [2018-11-10 06:52:31,388 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label20_true-unreach-call_false-termination.c [2018-11-10 06:52:31,431 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 06:52:31,431 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 06:52:31,432 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 06:52:31,432 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 06:52:31,432 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:52:31,432 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:52:31,432 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 06:52:31,432 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:52:31,432 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 06:52:31,448 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 06:52:31,476 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 06:52:31,476 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:52:31,476 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:52:31,484 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:52:31,484 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:52:31,484 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 06:52:31,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 06:52:31,490 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 06:52:31,490 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:52:31,490 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:52:31,491 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:52:31,491 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 06:52:31,497 INFO L793 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-10 06:52:31,498 INFO L795 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-10 06:52:31,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:31,503 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 06:52:31,504 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:31,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:31,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:31,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:31,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:31,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:31,591 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:31,591 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 06:52:31,591 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:31,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:31,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:31,592 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:31,592 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:31,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:31,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:31,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 06:52:31,613 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:31,613 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:31,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:31,614 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:31,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:52:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:52:31,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:52:31,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:52:31,824 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:52:31,825 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:52:31,825 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:52:31,825 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:52:31,825 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 06:52:31,825 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:52:31,826 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:52:31,826 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:52:31,826 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label20_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 06:52:31,826 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:52:31,827 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:52:31,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:31,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:31,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-11-10 06:52:31,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:31,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:31,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:31,918 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:31,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:32,125 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:52:32,126 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:32,129 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:32,130 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:32,159 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:32,159 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:32,163 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:32,163 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:32,170 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:32,170 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:32,191 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:32,191 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:32,207 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:32,207 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:32,211 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:32,211 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:32,227 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:32,227 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:32,268 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:32,268 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:32,290 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:32,291 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:32,299 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:32,299 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:32,301 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:32,302 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:32,318 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:32,318 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:32,322 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:32,323 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:32,339 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:32,339 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:32,357 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:52:32,358 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:32,388 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 06:52:32,389 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:52:32,389 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:52:32,389 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:52:32,390 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:52:32,390 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:52:32,390 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:52:32,390 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:52:32,390 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:52:32,391 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label20_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 06:52:32,391 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:52:32,391 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:52:32,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:32,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-11-10 06:52:32,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-11-10 06:52:32,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:32,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:32,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:32,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:32,437 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:32,616 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:52:32,621 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:52:32,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,624 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:32,627 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:32,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:32,642 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:32,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,644 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,645 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:52:32,645 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:32,647 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:32,647 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,665 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:32,666 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:32,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,669 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,670 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:32,671 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:32,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,674 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:32,675 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:32,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,676 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,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-11-10 06:52:32,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:32,678 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:32,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,681 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:32,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:32,682 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,686 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,686 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 06:52:32,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-11-10 06:52:32,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,687 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,688 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,688 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,689 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,695 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,695 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,696 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,697 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,700 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:52:32,700 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,721 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 06:52:32,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,741 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,744 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,748 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,748 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,749 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,749 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,753 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,754 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,754 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,755 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,755 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,757 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,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-11-10 06:52:32,758 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,758 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,762 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,762 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,763 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,764 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:32,765 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,765 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:32,765 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,773 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,773 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 06:52:32,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,776 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,777 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,783 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,784 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,785 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,789 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,790 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,790 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:52:32,790 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,791 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:52:32,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,802 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,805 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,808 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,809 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,810 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,814 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,815 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,816 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,818 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,818 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,819 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,820 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:32,820 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,820 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:32,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,824 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,824 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 06:52:32,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,825 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:32,826 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:32,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,832 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,833 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:32,833 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:32,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,838 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:52:32,838 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:32,840 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 06:52:32,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,851 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,852 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,852 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,852 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,853 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,854 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:32,855 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:32,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,857 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,857 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,858 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,858 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,858 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:32,860 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:32,860 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,863 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:32,863 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:32,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,865 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,866 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:32,866 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:32,866 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,867 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:32,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,868 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:32,868 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:32,869 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:52:32,869 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,872 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,873 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 06:52:32,873 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,873 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,874 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:32,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,874 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,875 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,885 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,886 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,886 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:32,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,886 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,887 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,889 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,890 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,890 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:32,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,890 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:52:32,890 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,892 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 06:52:32,892 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,915 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,915 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,915 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,915 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:32,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,916 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,917 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,922 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,922 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,922 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:32,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,923 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,923 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,923 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,923 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,930 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:32,930 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,930 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,930 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,931 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,932 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,933 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:32,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,933 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,933 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,933 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,934 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:32,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,934 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,935 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:32,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,935 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:32,935 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:32,936 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:32,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,941 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,941 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 06:52:32,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,943 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:32,943 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,943 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,944 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,945 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,954 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,955 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,955 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:32,955 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,955 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,955 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,956 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,956 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,959 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,959 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:32,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,960 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:52:32,960 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,961 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:52:32,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,982 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,983 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:32,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,983 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,984 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,987 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,988 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,988 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,988 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:32,988 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,988 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,988 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,989 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,989 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,989 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,992 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,993 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:32,993 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,993 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,993 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,993 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,994 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,996 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,997 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:32,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:32,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:32,997 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:32,997 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:32,998 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:32,999 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:32,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:32,999 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:32,999 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:32,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:32,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,000 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:33,000 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:33,002 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:33,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,009 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,009 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 06:52:33,010 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,010 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,010 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,011 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:33,013 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:33,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,019 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,020 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,020 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,020 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,020 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:33,021 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:33,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,024 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,025 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,025 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,026 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:52:33,026 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:33,029 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 06:52:33,029 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,054 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,055 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,056 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:33,057 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:33,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,063 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,063 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,064 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,064 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,064 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:33,065 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:33,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,068 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,069 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,069 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,070 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:33,070 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:33,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,074 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,074 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,075 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:33,076 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:33,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,076 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,077 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,077 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,077 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:33,078 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:33,079 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:52:33,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,086 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,086 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 06:52:33,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,087 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,087 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:33,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,087 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:33,088 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:33,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,095 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,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-11-10 06:52:33,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,096 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:33,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,096 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:33,097 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:33,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,098 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,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-11-10 06:52:33,099 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,099 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:33,099 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,100 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:52:33,100 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:33,101 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:52:33,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,117 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,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-11-10 06:52:33,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,118 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:33,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,118 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,118 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,119 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:33,119 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:33,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,123 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,124 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:33,124 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,124 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:33,124 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:33,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,126 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,127 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:33,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,127 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:33,127 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:33,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,129 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,130 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,130 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:33,130 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,130 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:33,131 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:33,131 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,132 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,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-11-10 06:52:33,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,133 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:33,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,133 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:33,133 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:33,134 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:33,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,139 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,140 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 06:52:33,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,140 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,140 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,141 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,141 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,141 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:33,142 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:33,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,165 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,166 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,166 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,166 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:33,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:33,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,169 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,171 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,171 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,172 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,172 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,172 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 06:52:33,172 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:33,174 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 06:52:33,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,226 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,226 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,226 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,227 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,227 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:33,228 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:33,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,234 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,235 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,235 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,236 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:33,236 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:33,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,239 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,239 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,240 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:33,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:33,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,242 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,243 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,243 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,243 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:33,244 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:33,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:33,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,246 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:33,247 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:33,247 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:33,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:33,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:33,247 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:33,248 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:33,249 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:52:33,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:33,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:33,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:52:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:52:33,265 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 06:52:33,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:52:33,789 INFO L93 Difference]: Finished difference Result 381 states and 547 transitions. [2018-11-10 06:52:33,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:52:33,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 547 transitions. [2018-11-10 06:52:33,794 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 06:52:33,800 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 373 states and 539 transitions. [2018-11-10 06:52:33,801 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 373 [2018-11-10 06:52:33,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 373 [2018-11-10 06:52:33,803 INFO L73 IsDeterministic]: Start isDeterministic. Operand 373 states and 539 transitions. [2018-11-10 06:52:33,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:52:33,805 INFO L705 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 06:52:33,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states and 539 transitions. [2018-11-10 06:52:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 372. [2018-11-10 06:52:33,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-11-10 06:52:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 537 transitions. [2018-11-10 06:52:33,837 INFO L728 BuchiCegarLoop]: Abstraction has 372 states and 537 transitions. [2018-11-10 06:52:33,837 INFO L608 BuchiCegarLoop]: Abstraction has 372 states and 537 transitions. [2018-11-10 06:52:33,837 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 06:52:33,837 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 372 states and 537 transitions. [2018-11-10 06:52:33,839 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 370 [2018-11-10 06:52:33,840 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:52:33,840 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:52:33,840 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:52:33,840 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:52:33,840 INFO L793 eck$LassoCheckResult]: Stem: 753#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 631#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 632#L606-3 [2018-11-10 06:52:33,841 INFO L795 eck$LassoCheckResult]: Loop: 632#L606-3 assume true; 862#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 948#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 947#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 946#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 945#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 944#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 943#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 942#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 941#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 634#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 632#L606-3 [2018-11-10 06:52:33,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:33,841 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 06:52:33,841 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:33,841 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:33,842 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:33,842 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:33,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:33,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:33,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:33,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 06:52:33,852 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:33,852 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:33,852 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:33,853 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:52:33,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:33,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:33,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:33,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:33,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 06:52:33,864 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:33,864 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:33,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:33,865 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:33,865 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:33,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:52:33,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:52:33,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:52:33,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:52:33,966 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:52:33,966 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:52:33,966 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:52:33,966 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:52:33,966 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 06:52:33,966 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:52:33,967 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:52:33,967 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:52:33,967 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label20_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 06:52:33,967 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:52:33,967 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:52:33,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:33,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:33,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:33,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:33,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:33,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:33,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:33,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:34,090 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:52:34,090 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:34,108 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:34,108 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:34,126 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:34,126 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:34,132 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:34,132 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:34,135 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:34,135 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:34,155 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:34,155 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:34,158 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:34,158 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:34,178 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:34,179 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:34,181 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:34,181 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:34,199 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:34,199 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:34,215 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:34,215 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:34,223 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:34,223 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:34,315 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:52:34,315 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:34,347 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 06:52:34,349 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:52:34,349 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:52:34,349 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:52:34,349 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:52:34,349 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 06:52:34,349 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:52:34,349 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:52:34,349 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:52:34,349 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label20_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 06:52:34,349 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:52:34,349 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:52:34,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:34,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:34,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:34,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:34,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:34,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:34,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-11-10 06:52:34,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:34,465 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:52:34,465 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 06:52:34,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,466 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,466 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,466 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:34,466 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:34,467 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,468 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,469 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:34,469 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:34,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,470 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,471 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,471 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:34,471 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,472 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:34,473 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:34,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,473 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,473 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:34,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:34,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,475 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,476 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,476 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:34,476 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,477 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,478 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,478 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:34,478 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,481 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 06:52:34,482 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 06:52:34,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,483 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,484 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 06:52:34,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,485 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,485 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:34,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,486 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,487 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,487 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,487 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,487 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:34,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,488 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,489 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,489 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,490 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,491 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,491 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,491 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:34,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,492 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,493 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,493 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:34,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,495 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,495 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,495 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,498 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,498 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,501 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,502 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,502 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,502 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,503 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:34,503 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,505 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,505 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 06:52:34,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,506 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,506 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,508 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,508 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,511 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,511 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,512 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:34,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,512 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,513 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,513 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,514 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,514 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,515 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,515 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,515 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,516 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,517 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,517 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,518 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:34,518 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,520 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,521 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,521 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,521 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,521 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,521 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,522 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:34,522 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,526 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,528 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,531 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,531 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 06:52:34,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-11-10 06:52:34,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,532 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,532 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:34,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,534 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,535 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,535 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:34,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,538 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,539 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,539 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:52:34,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,540 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,541 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,541 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:34,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,542 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,542 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,543 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:34,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,545 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,545 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,546 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:52:34,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,549 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,549 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,549 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,550 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:52:34,550 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,555 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,556 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,556 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 06:52:34,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,557 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,557 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:34,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,560 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,561 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 06:52:34,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,561 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,562 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,562 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:34,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,565 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,565 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,565 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,566 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:34,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,569 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,569 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,570 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,570 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,570 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,572 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,572 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,572 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,572 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,573 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:34,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,574 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,574 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,575 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:34,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,576 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,577 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,577 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,578 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,582 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,583 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,583 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,583 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,583 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,584 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,591 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,592 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,592 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,592 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 06:52:34,593 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 06:52:34,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,597 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,597 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 06:52:34,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,598 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,598 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:34,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,598 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,599 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,601 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,602 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:34,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,602 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,603 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,603 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,608 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:34,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,608 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,608 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,609 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:34,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,611 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:34,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,611 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,612 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,613 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:34,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,614 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,614 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,617 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,618 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:34,618 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,618 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,618 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,619 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:34,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,625 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,626 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:34,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,626 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,628 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:34,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,638 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,639 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,639 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 06:52:34,639 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,640 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,641 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,646 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,647 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 06:52:34,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,647 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,647 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,648 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,649 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:34,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,652 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,653 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,653 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,654 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,655 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:34,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,660 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,661 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,661 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,662 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,662 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,663 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:52:34,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,664 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,665 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,665 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,665 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,666 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:34,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,667 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,667 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,668 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,669 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:34,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,672 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,673 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,673 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,674 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,675 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:52:34,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,684 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,685 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,685 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,685 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,688 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 06:52:34,688 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,705 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,706 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,706 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 06:52:34,708 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 06:52:34,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,718 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,718 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 06:52:34,718 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,719 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,719 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,719 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,719 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,721 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,722 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,722 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,722 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,723 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,726 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,727 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,727 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,727 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,727 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:34,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,730 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,730 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,731 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,732 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,733 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,733 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,733 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,733 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,735 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,736 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,736 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,736 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,737 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:34,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,741 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,742 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,742 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,742 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,743 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 06:52:34,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,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-11-10 06:52:34,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,751 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 06:52:34,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,751 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 06:52:34,752 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 06:52:34,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,758 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 06:52:34,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,759 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,759 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:34,760 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,762 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,763 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,763 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,763 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:34,764 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,771 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,771 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,772 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,772 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,772 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:34,773 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:52:34,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,775 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,775 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,776 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:34,776 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,779 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,779 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,779 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,780 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:34,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,780 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,782 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,783 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,783 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,784 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,784 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:34,785 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:52:34,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,794 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,794 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,794 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 06:52:34,794 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:34,796 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 06:52:34,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 06:52:34,818 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 06:52:34,819 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 06:52:34,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 06:52:34,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 06:52:34,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 06:52:34,819 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 06:52:34,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 06:52:34,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 06:52:34,841 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 06:52:34,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:52:34,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:52:34,842 INFO L87 Difference]: Start difference. First operand 372 states and 537 transitions. cyclomatic complexity: 166 Second operand 3 states. [2018-11-10 06:52:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:52:35,315 INFO L93 Difference]: Finished difference Result 659 states and 915 transitions. [2018-11-10 06:52:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:52:35,315 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 659 states and 915 transitions. [2018-11-10 06:52:35,319 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 657 [2018-11-10 06:52:35,323 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 659 states to 659 states and 915 transitions. [2018-11-10 06:52:35,323 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 659 [2018-11-10 06:52:35,325 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 659 [2018-11-10 06:52:35,326 INFO L73 IsDeterministic]: Start isDeterministic. Operand 659 states and 915 transitions. [2018-11-10 06:52:35,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:52:35,328 INFO L705 BuchiCegarLoop]: Abstraction has 659 states and 915 transitions. [2018-11-10 06:52:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states and 915 transitions. [2018-11-10 06:52:35,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2018-11-10 06:52:35,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-11-10 06:52:35,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 915 transitions. [2018-11-10 06:52:35,348 INFO L728 BuchiCegarLoop]: Abstraction has 659 states and 915 transitions. [2018-11-10 06:52:35,348 INFO L608 BuchiCegarLoop]: Abstraction has 659 states and 915 transitions. [2018-11-10 06:52:35,348 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 06:52:35,348 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 659 states and 915 transitions. [2018-11-10 06:52:35,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 657 [2018-11-10 06:52:35,352 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:52:35,352 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:52:35,353 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:52:35,353 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:52:35,354 INFO L793 eck$LassoCheckResult]: Stem: 1793#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1671#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1672#L606-3 [2018-11-10 06:52:35,354 INFO L795 eck$LassoCheckResult]: Loop: 1672#L606-3 assume true; 1900#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1771#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1772#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1918#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1683#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2184#L606-3 assume true; 2182#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2180#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2178#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2176#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 2174#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2172#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2170#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2168#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2166#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2164#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2162#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2160#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2158#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2156#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2154#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2152#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2150#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2148#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2146#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2144#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2142#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2140#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2138#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2136#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2134#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2132#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2130#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2128#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2126#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2124#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2122#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2120#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2118#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2116#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2114#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2112#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2110#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2108#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2106#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2104#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2102#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2100#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2098#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2096#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2094#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2092#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2090#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2089#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2087#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1779#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1672#L606-3 [2018-11-10 06:52:35,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:35,355 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 06:52:35,355 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:35,355 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:35,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:35,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:35,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:35,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:35,369 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 06:52:35,369 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:35,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:35,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:35,370 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:52:35,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:52:35,451 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:52:35,452 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:52:35,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 06:52:35,452 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:52:35,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 06:52:35,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 06:52:35,452 INFO L87 Difference]: Start difference. First operand 659 states and 915 transitions. cyclomatic complexity: 257 Second operand 4 states. [2018-11-10 06:52:36,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:52:36,202 INFO L93 Difference]: Finished difference Result 1227 states and 1696 transitions. [2018-11-10 06:52:36,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 06:52:36,203 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1227 states and 1696 transitions. [2018-11-10 06:52:36,207 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1223 [2018-11-10 06:52:36,210 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1227 states to 1227 states and 1696 transitions. [2018-11-10 06:52:36,210 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1227 [2018-11-10 06:52:36,211 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1227 [2018-11-10 06:52:36,211 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1227 states and 1696 transitions. [2018-11-10 06:52:36,212 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:52:36,212 INFO L705 BuchiCegarLoop]: Abstraction has 1227 states and 1696 transitions. [2018-11-10 06:52:36,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states and 1696 transitions. [2018-11-10 06:52:36,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2018-11-10 06:52:36,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1224 states. [2018-11-10 06:52:36,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1690 transitions. [2018-11-10 06:52:36,227 INFO L728 BuchiCegarLoop]: Abstraction has 1224 states and 1690 transitions. [2018-11-10 06:52:36,227 INFO L608 BuchiCegarLoop]: Abstraction has 1224 states and 1690 transitions. [2018-11-10 06:52:36,227 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 06:52:36,227 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1224 states and 1690 transitions. [2018-11-10 06:52:36,230 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1220 [2018-11-10 06:52:36,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:52:36,231 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:52:36,232 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:52:36,232 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:52:36,232 INFO L793 eck$LassoCheckResult]: Stem: 3686#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3563#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3564#L606-3 [2018-11-10 06:52:36,233 INFO L795 eck$LassoCheckResult]: Loop: 3564#L606-3 assume true; 4592#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4591#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4590#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4588#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4586#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4584#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4582#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4539#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3743#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4533#L606-3 assume true; 4531#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4529#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4527#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3707#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4726#L606-3 assume true; 4173#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4164#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4163#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4161#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4159#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4157#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4155#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4153#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4151#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4149#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4147#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4145#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4143#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4141#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4139#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4137#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4135#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4133#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4131#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4129#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4127#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4125#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4123#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4121#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 4119#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4117#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 4115#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 4113#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4111#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4109#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4107#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4105#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 4103#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4101#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4099#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4097#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 4095#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4093#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4091#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 4089#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4087#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 4085#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 4083#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4081#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4079#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4077#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4075#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4073#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4070#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4071#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3564#L606-3 [2018-11-10 06:52:36,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:36,233 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 06:52:36,233 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:36,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:36,233 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:36,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:36,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:36,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:36,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:36,237 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 06:52:36,237 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:36,237 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:36,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:36,237 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:52:36,238 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:36,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:52:36,260 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:52:36,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:52:36,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:52:36,261 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:52:36,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:52:36,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:52:36,261 INFO L87 Difference]: Start difference. First operand 1224 states and 1690 transitions. cyclomatic complexity: 468 Second operand 3 states. [2018-11-10 06:52:36,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:52:36,622 INFO L93 Difference]: Finished difference Result 1508 states and 1999 transitions. [2018-11-10 06:52:36,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:52:36,622 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1508 states and 1999 transitions. [2018-11-10 06:52:36,626 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 06:52:36,629 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1508 states to 1508 states and 1999 transitions. [2018-11-10 06:52:36,629 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1508 [2018-11-10 06:52:36,630 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1508 [2018-11-10 06:52:36,630 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1508 states and 1999 transitions. [2018-11-10 06:52:36,632 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:52:36,632 INFO L705 BuchiCegarLoop]: Abstraction has 1508 states and 1999 transitions. [2018-11-10 06:52:36,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1508 states and 1999 transitions. [2018-11-10 06:52:36,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1508 to 1507. [2018-11-10 06:52:36,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 06:52:36,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1997 transitions. [2018-11-10 06:52:36,644 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1997 transitions. [2018-11-10 06:52:36,644 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1997 transitions. [2018-11-10 06:52:36,645 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 06:52:36,645 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1997 transitions. [2018-11-10 06:52:36,648 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1503 [2018-11-10 06:52:36,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:52:36,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:52:36,650 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:52:36,650 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:52:36,650 INFO L793 eck$LassoCheckResult]: Stem: 6423#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6301#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6302#L606-3 [2018-11-10 06:52:36,650 INFO L795 eck$LassoCheckResult]: Loop: 6302#L606-3 assume true; 7630#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7620#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7606#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7605#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 7604#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 7602#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 7601#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 7600#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 7598#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 7596#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 7594#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 7592#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 7590#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 7588#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 7586#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7584#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7582#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6925#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6526#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6915#L606-3 assume true; 6913#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6911#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6909#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6443#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6917#L606-3 assume true; 6916#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6914#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6912#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 6910#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6908#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 6906#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6904#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 6902#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6900#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 6898#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 6896#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 6894#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 6892#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6890#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 6888#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6886#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6884#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6882#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 6880#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 6878#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 6876#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 6874#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 6872#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 6870#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 6868#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 6866#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 6864#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 6862#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 6860#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 6858#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 6856#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 6854#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 6852#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 6850#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6848#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 6846#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 6844#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 6842#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6840#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 6838#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 6836#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 6834#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 6832#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 6830#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 6828#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 6826#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 6824#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 6822#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 6818#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6819#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6302#L606-3 [2018-11-10 06:52:36,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:36,651 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 06:52:36,651 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:36,651 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:36,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:36,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:36,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:36,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:36,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 06:52:36,655 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:36,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:36,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:36,656 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:52:36,656 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:36,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:52:36,688 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 06:52:36,689 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:52:36,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:52:36,689 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:52:36,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:52:36,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:52:36,689 INFO L87 Difference]: Start difference. First operand 1507 states and 1997 transitions. cyclomatic complexity: 492 Second operand 3 states. [2018-11-10 06:52:37,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:52:37,008 INFO L93 Difference]: Finished difference Result 1506 states and 1820 transitions. [2018-11-10 06:52:37,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:52:37,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1506 states and 1820 transitions. [2018-11-10 06:52:37,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1503 [2018-11-10 06:52:37,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1506 states to 1506 states and 1820 transitions. [2018-11-10 06:52:37,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1506 [2018-11-10 06:52:37,018 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1506 [2018-11-10 06:52:37,018 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1506 states and 1820 transitions. [2018-11-10 06:52:37,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:52:37,019 INFO L705 BuchiCegarLoop]: Abstraction has 1506 states and 1820 transitions. [2018-11-10 06:52:37,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1506 states and 1820 transitions. [2018-11-10 06:52:37,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1506 to 1506. [2018-11-10 06:52:37,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1506 states. [2018-11-10 06:52:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1506 states to 1506 states and 1820 transitions. [2018-11-10 06:52:37,030 INFO L728 BuchiCegarLoop]: Abstraction has 1506 states and 1820 transitions. [2018-11-10 06:52:37,030 INFO L608 BuchiCegarLoop]: Abstraction has 1506 states and 1820 transitions. [2018-11-10 06:52:37,031 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 06:52:37,031 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1506 states and 1820 transitions. [2018-11-10 06:52:37,034 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1503 [2018-11-10 06:52:37,034 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:52:37,035 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:52:37,036 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:52:37,036 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:52:37,036 INFO L793 eck$LassoCheckResult]: Stem: 9440#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9320#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9321#L606-3 [2018-11-10 06:52:37,036 INFO L795 eck$LassoCheckResult]: Loop: 9321#L606-3 assume true; 9989#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9987#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9985#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9983#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9981#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9979#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9977#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9975#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9973#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9971#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9969#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9967#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9965#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9964#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9963#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9961#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9959#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9888#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9889#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 10063#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10061#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10059#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10057#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10055#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10053#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10051#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10049#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10047#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9779#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9669#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9772#L606-3 assume true; 9770#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9768#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9766#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9764#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9762#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9760#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9758#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9756#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9754#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9752#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9750#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9748#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9746#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9744#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9742#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9740#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9738#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9736#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9734#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9732#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9730#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9728#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9726#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9724#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9722#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9720#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9718#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9715#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9713#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9711#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9709#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9707#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9705#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9703#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9701#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9699#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9697#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9695#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9693#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9691#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9689#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9687#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9685#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9683#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9681#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9679#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9677#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9675#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9672#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9673#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9321#L606-3 [2018-11-10 06:52:37,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:37,036 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 06:52:37,036 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:37,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:37,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:37,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:37,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:37,040 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:37,040 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 06:52:37,041 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:37,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:37,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:37,041 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:52:37,041 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:37,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:52:37,095 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:52:37,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:52:37,095 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 06:52:37,096 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 06:52:37,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 06:52:37,096 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 06:52:37,096 INFO L87 Difference]: Start difference. First operand 1506 states and 1820 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-10 06:52:37,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:52:37,285 INFO L93 Difference]: Finished difference Result 1495 states and 1776 transitions. [2018-11-10 06:52:37,286 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 06:52:37,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1495 states and 1776 transitions. [2018-11-10 06:52:37,290 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1492 [2018-11-10 06:52:37,293 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1495 states to 1495 states and 1776 transitions. [2018-11-10 06:52:37,293 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1495 [2018-11-10 06:52:37,294 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1495 [2018-11-10 06:52:37,294 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1495 states and 1776 transitions. [2018-11-10 06:52:37,296 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:52:37,296 INFO L705 BuchiCegarLoop]: Abstraction has 1495 states and 1776 transitions. [2018-11-10 06:52:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1495 states and 1776 transitions. [2018-11-10 06:52:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1495 to 1495. [2018-11-10 06:52:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1495 states. [2018-11-10 06:52:37,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1495 states to 1495 states and 1776 transitions. [2018-11-10 06:52:37,307 INFO L728 BuchiCegarLoop]: Abstraction has 1495 states and 1776 transitions. [2018-11-10 06:52:37,307 INFO L608 BuchiCegarLoop]: Abstraction has 1495 states and 1776 transitions. [2018-11-10 06:52:37,307 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 06:52:37,307 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1495 states and 1776 transitions. [2018-11-10 06:52:37,311 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1492 [2018-11-10 06:52:37,311 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:52:37,311 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:52:37,311 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 06:52:37,312 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:52:37,312 INFO L793 eck$LassoCheckResult]: Stem: 12447#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12327#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12328#L606-3 [2018-11-10 06:52:37,313 INFO L795 eck$LassoCheckResult]: Loop: 12328#L606-3 assume true; 13013#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13011#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13009#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13007#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13005#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 13003#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13001#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 12999#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 12997#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12995#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 12993#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 12991#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 12989#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 12987#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 12985#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 12983#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 12981#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 12979#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 12977#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 12975#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 12973#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 12971#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 12969#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 12967#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 12965#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12963#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 12961#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 12959#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12858#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12859#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13448#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13446#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13444#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13442#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13440#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13438#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13436#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13434#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13432#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13430#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13428#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13426#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13424#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13422#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13420#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 12856#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 12857#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 13712#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 13710#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 13708#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 13706#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 13704#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 13703#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13702#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 13701#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13700#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 13698#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 13696#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 13694#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 13692#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 13571#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 13570#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 13569#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13567#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 13565#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 13564#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 13563#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 13561#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 13559#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 13557#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 13555#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 13553#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 13551#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 13549#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 13547#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 13545#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 13543#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 13541#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13539#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13537#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13535#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13533#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13531#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13529#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13527#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13525#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12344#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13719#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13718#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13717#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13523#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13132#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13108#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13107#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13105#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13103#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13101#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13099#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13097#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13095#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13093#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13091#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13089#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13087#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13085#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13083#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13081#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13079#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13077#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13075#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13073#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13071#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12480#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13068#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13066#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13064#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13062#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13060#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13058#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13056#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13054#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13052#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13050#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13048#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13046#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13044#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13042#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13040#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13038#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13036#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13034#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13032#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13030#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13028#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13026#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13024#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13022#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13020#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13018#L594-1 calculate_output_#res := -2; 13016#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12328#L606-3 [2018-11-10 06:52:37,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:37,313 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 06:52:37,313 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:37,313 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:37,313 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:37,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:37,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:37,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:37,317 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 06:52:37,317 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:37,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:37,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:37,318 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:37,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:37,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:37,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:37,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 06:52:37,351 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:37,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:37,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:37,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:37,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:52:37,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:52:37,684 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:52:37,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 06:52:38,351 WARN L179 SmtUtils]: Spent 655.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 06:52:38,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 06:52:38,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 06:52:38,413 INFO L87 Difference]: Start difference. First operand 1495 states and 1776 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-10 06:52:39,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:52:39,386 INFO L93 Difference]: Finished difference Result 1688 states and 1967 transitions. [2018-11-10 06:52:39,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 06:52:39,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1967 transitions. [2018-11-10 06:52:39,391 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 06:52:39,397 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1967 transitions. [2018-11-10 06:52:39,397 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 06:52:39,398 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 06:52:39,398 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1967 transitions. [2018-11-10 06:52:39,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 06:52:39,400 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1967 transitions. [2018-11-10 06:52:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1967 transitions. [2018-11-10 06:52:39,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 06:52:39,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 06:52:39,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1825 transitions. [2018-11-10 06:52:39,418 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 06:52:39,418 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1825 transitions. [2018-11-10 06:52:39,418 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 06:52:39,419 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1825 transitions. [2018-11-10 06:52:39,423 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 06:52:39,423 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 06:52:39,423 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 06:52:39,424 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:52:39,424 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:52:39,424 INFO L793 eck$LassoCheckResult]: Stem: 15652#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15535#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15536#L606-3 assume true; 16191#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16189#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16187#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16185#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15792#L597 [2018-11-10 06:52:39,424 INFO L795 eck$LassoCheckResult]: Loop: 15792#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16282#L606-3 assume true; 16280#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16278#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16276#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16274#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16272#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 16270#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16268#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15792#L597 [2018-11-10 06:52:39,424 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:39,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 06:52:39,425 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:39,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:39,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:39,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:39,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:39,431 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 06:52:39,431 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:39,431 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:39,431 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:39,431 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:39,432 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:39,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:52:39,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 06:52:39,436 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 06:52:39,436 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 06:52:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:39,437 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:52:39,437 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:52:39,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 06:52:39,606 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 06:52:39,606 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 06:52:39,607 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 06:52:39,607 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 06:52:39,607 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 06:52:39,607 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 06:52:39,607 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 06:52:39,607 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 06:52:39,607 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label20_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 06:52:39,607 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 06:52:39,607 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 06:52:39,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,618 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,621 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,625 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,630 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,633 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 06:52:39,768 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 06:52:39,768 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,772 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,772 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,775 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,775 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,792 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,792 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,807 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,807 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,810 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,811 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,812 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,812 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,829 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,829 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,831 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,831 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,847 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,848 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,850 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,850 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,866 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,866 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,882 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,882 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,885 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,885 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,888 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,888 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,904 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,904 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,919 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,919 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,924 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,924 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,940 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,940 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,944 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,944 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,946 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,946 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,962 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,962 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,978 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,978 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:39,981 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:39,981 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:39,997 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:39,998 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:40,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:40,004 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:40,004 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:40,021 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:40,022 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:40,023 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,038 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:40,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:40,054 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:40,054 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:40,058 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,079 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:52:40,079 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:40,273 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:40,273 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:40,289 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:40,291 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:40,292 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,308 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:40,308 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,326 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 06:52:40,326 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:40,474 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:40,474 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,490 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:40,490 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:40,506 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:40,506 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,509 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:40,509 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:40,512 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:40,512 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/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-11-10 06:52:40,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 06:52:40,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 06:52:40,531 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 06:52:40,531 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-10 06:52:40,570 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 06:52:40 BoogieIcfgContainer [2018-11-10 06:52:40,570 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 06:52:40,571 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:52:40,571 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:52:40,571 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:52:40,571 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:52:31" (3/4) ... [2018-11-10 06:52:40,574 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 06:52:40,609 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_0f5b499d-6720-4833-a97a-02768733dba2/bin-2019/uautomizer/witness.graphml [2018-11-10 06:52:40,609 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:52:40,610 INFO L168 Benchmark]: Toolchain (without parser) took 10609.45 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 498.6 MB). Free memory was 956.4 MB in the beginning and 1.0 GB in the end (delta: -63.0 MB). Peak memory consumption was 435.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:52:40,611 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:52:40,611 INFO L168 Benchmark]: CACSL2BoogieTranslator took 355.06 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. [2018-11-10 06:52:40,611 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 926.9 MB in the beginning and 1.2 GB in the end (delta: -234.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:52:40,611 INFO L168 Benchmark]: Boogie Preprocessor took 41.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-10 06:52:40,612 INFO L168 Benchmark]: RCFGBuilder took 864.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 109.6 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:52:40,612 INFO L168 Benchmark]: BuchiAutomizer took 9188.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 29.1 MB). Peak memory consumption was 355.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:52:40,612 INFO L168 Benchmark]: Witness Printer took 38.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2018-11-10 06:52:40,614 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 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 355.06 ms. Allocated memory is still 1.0 GB. Free memory was 956.4 MB in the beginning and 926.9 MB in the end (delta: 29.5 MB). Peak memory consumption was 29.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 172.0 MB). Free memory was 926.9 MB in the beginning and 1.2 GB in the end (delta: -234.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 41.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 864.09 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.0 GB in the end (delta: 109.6 MB). Peak memory consumption was 109.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9188.83 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 326.6 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 29.1 MB). Peak memory consumption was 355.7 MB. Max. memory is 11.5 GB. * Witness Printer took 38.66 ms. Allocated memory is still 1.5 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.2s. Construction of modules took 2.6s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 2286 SDslu, 560 SDs, 0 SdLazy, 3963 SolverSat, 837 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.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: 55ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - 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@2f9b75d4=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@226ad43c=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@2f9b75d4=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@226ad43c=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@2f9b75d4=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@226ad43c=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i 4 + -4*0^k + -4*k + -5*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...