./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/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 ebfe45d4aa38a1256db2ee760b5b480b689c30c4 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 22:12:34,502 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 22:12:34,503 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 22:12:34,512 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 22:12:34,512 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 22:12:34,512 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 22:12:34,513 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 22:12:34,515 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 22:12:34,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 22:12:34,516 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 22:12:34,517 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 22:12:34,517 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 22:12:34,518 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 22:12:34,519 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 22:12:34,519 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 22:12:34,520 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 22:12:34,521 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 22:12:34,522 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 22:12:34,523 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 22:12:34,524 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 22:12:34,525 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 22:12:34,526 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 22:12:34,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 22:12:34,528 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 22:12:34,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 22:12:34,528 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 22:12:34,529 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 22:12:34,530 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 22:12:34,530 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 22:12:34,531 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 22:12:34,531 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 22:12:34,532 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 22:12:34,532 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 22:12:34,532 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 22:12:34,533 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 22:12:34,533 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 22:12:34,533 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-08 22:12:34,545 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 22:12:34,545 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 22:12:34,546 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 22:12:34,546 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 22:12:34,546 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 22:12:34,546 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 22:12:34,547 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 22:12:34,547 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 22:12:34,547 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 22:12:34,547 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 22:12:34,547 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 22:12:34,547 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 22:12:34,547 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 22:12:34,548 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 22:12:34,548 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 22:12:34,548 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 22:12:34,548 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 22:12:34,548 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 22:12:34,548 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 22:12:34,548 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 22:12:34,549 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 22:12:34,549 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 22:12:34,549 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 22:12:34,549 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 22:12:34,549 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 22:12:34,549 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 22:12:34,549 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 22:12:34,549 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 22:12:34,549 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 22:12:34,549 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 22:12:34,549 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 22:12:34,550 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 22:12:34,550 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_d42f1bb9-d2f8-42da-821d-9341eb833a40/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 -> ebfe45d4aa38a1256db2ee760b5b480b689c30c4 [2018-12-08 22:12:34,573 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 22:12:34,581 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 22:12:34,584 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 22:12:34,585 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 22:12:34,585 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 22:12:34,586 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c [2018-12-08 22:12:34,630 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/data/89248651f/00da6ef79a3340398e920ff8038a9baa/FLAG848c64754 [2018-12-08 22:12:35,074 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 22:12:35,075 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/sv-benchmarks/c/eca-rers2012/Problem02_label10_true-unreach-call_false-termination.c [2018-12-08 22:12:35,082 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/data/89248651f/00da6ef79a3340398e920ff8038a9baa/FLAG848c64754 [2018-12-08 22:12:35,410 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/data/89248651f/00da6ef79a3340398e920ff8038a9baa [2018-12-08 22:12:35,413 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 22:12:35,414 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 22:12:35,414 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 22:12:35,414 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 22:12:35,417 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 22:12:35,417 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,419 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c8dc319 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35, skipping insertion in model container [2018-12-08 22:12:35,419 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,424 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 22:12:35,450 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 22:12:35,624 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:12:35,627 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 22:12:35,673 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 22:12:35,725 INFO L195 MainTranslator]: Completed translation [2018-12-08 22:12:35,726 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35 WrapperNode [2018-12-08 22:12:35,726 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 22:12:35,727 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 22:12:35,727 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 22:12:35,727 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 22:12:35,735 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,773 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 22:12:35,773 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 22:12:35,773 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 22:12:35,773 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 22:12:35,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,781 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,796 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,798 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (1/1) ... [2018-12-08 22:12:35,801 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 22:12:35,802 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 22:12:35,802 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 22:12:35,802 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 22:12:35,802 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:35,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 22:12:35,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 22:12:36,393 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 22:12:36,393 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2018-12-08 22:12:36,394 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:12:36 BoogieIcfgContainer [2018-12-08 22:12:36,394 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 22:12:36,394 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 22:12:36,394 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 22:12:36,397 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 22:12:36,397 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 22:12:36,397 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 10:12:35" (1/3) ... [2018-12-08 22:12:36,398 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ecd2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:12:36, skipping insertion in model container [2018-12-08 22:12:36,398 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 22:12:36,398 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 10:12:35" (2/3) ... [2018-12-08 22:12:36,398 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6ecd2c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 10:12:36, skipping insertion in model container [2018-12-08 22:12:36,399 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 22:12:36,399 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:12:36" (3/3) ... [2018-12-08 22:12:36,400 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label10_true-unreach-call_false-termination.c [2018-12-08 22:12:36,430 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 22:12:36,431 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 22:12:36,431 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 22:12:36,431 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 22:12:36,431 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 22:12:36,431 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 22:12:36,431 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 22:12:36,431 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 22:12:36,432 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 22:12:36,444 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-08 22:12:36,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-08 22:12:36,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:12:36,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:12:36,468 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 22:12:36,468 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 22:12:36,469 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 22:12:36,469 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states. [2018-12-08 22:12:36,473 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 221 [2018-12-08 22:12:36,473 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:12:36,473 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:12:36,474 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 22:12:36,474 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2018-12-08 22:12:36,479 INFO L794 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 164#L606-2true [2018-12-08 22:12:36,479 INFO L796 eck$LassoCheckResult]: Loop: 164#L606-2true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 191#L30true assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 206#L597true main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 164#L606-2true [2018-12-08 22:12:36,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:36,484 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 22:12:36,485 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:36,485 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:36,514 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:36,514 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:36,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:36,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:36,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:36,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:36,546 INFO L82 PathProgramCache]: Analyzing trace with hash 1268139, now seen corresponding path program 1 times [2018-12-08 22:12:36,547 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:36,547 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:36,547 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:36,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:36,548 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:36,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:36,563 INFO L82 PathProgramCache]: Analyzing trace with hash 889695341, now seen corresponding path program 1 times [2018-12-08 22:12:36,563 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:36,563 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:36,563 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:36,563 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:36,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:36,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:36,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:36,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 22:12:36,725 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 22:12:36,726 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 22:12:36,726 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 22:12:36,726 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 22:12:36,726 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 22:12:36,726 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:36,726 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 22:12:36,727 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 22:12:36,727 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label10_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-08 22:12:36,727 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 22:12:36,727 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 22:12:36,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:36,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:36,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:36,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:36,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:36,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:36,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:36,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:36,939 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 22:12:36,940 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:36,943 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:36,943 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:36,947 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:36,948 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:36,963 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:36,963 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:36,967 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:36,968 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:36,983 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:36,983 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:36,987 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:36,987 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:37,002 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:37,002 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:37,005 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:37,005 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:37,020 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:37,020 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:37,023 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:37,023 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:37,039 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:37,039 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:37,042 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:37,042 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:37,057 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:37,058 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:37,061 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:37,062 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:37,077 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:37,077 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:37,094 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 22:12:37,094 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:37,126 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 22:12:37,127 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 22:12:37,127 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 22:12:37,128 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 22:12:37,128 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 22:12:37,128 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 22:12:37,128 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:37,128 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 22:12:37,128 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 22:12:37,128 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label10_true-unreach-call_false-termination.c_Iteration1_Loop [2018-12-08 22:12:37,128 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 22:12:37,128 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 22:12:37,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:37,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:37,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:37,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:37,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:37,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:37,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:37,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:37,312 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 22:12:37,315 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 22:12:37,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,317 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:37,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:37,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,330 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:37,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:37,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,334 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,335 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 22:12:37,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:37,336 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:37,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,352 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,354 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:37,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:37,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,360 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:37,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:37,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:37,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:37,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:37,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:37,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,371 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:37,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:37,372 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,376 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 22:12:37,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,377 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,378 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,379 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,386 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,387 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,389 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,389 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,390 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 22:12:37,390 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,392 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 22:12:37,392 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,407 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,407 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,412 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,412 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,416 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,416 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,419 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,420 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,422 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:37,422 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:37,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,426 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 22:12:37,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,427 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,428 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,434 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,434 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,435 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,435 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,438 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 22:12:37,438 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,440 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 22:12:37,440 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,451 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,451 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,452 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,452 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,452 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,456 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,456 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,457 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,459 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,459 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,459 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,459 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,460 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,460 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,462 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,462 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,463 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,463 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,464 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,464 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,464 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,465 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:37,465 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,466 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:37,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,469 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 22:12:37,469 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,470 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,471 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,476 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,477 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,477 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,480 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 22:12:37,480 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,482 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 22:12:37,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,493 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,493 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,497 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,498 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,500 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,501 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,503 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,503 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,504 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,504 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,504 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,505 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:37,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,506 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:37,506 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,507 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 22:12:37,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,511 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 22:12:37,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,512 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,512 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,512 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,513 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,524 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,525 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,525 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,525 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,525 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,525 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,526 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,526 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,526 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,529 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,530 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,530 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 22:12:37,530 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,532 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 22:12:37,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,555 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,555 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,556 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,556 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,556 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,556 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,557 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,557 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,562 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,562 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,562 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,565 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,565 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,566 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,566 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,569 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,569 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,569 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,569 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,570 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:37,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,571 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,572 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:37,572 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:37,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:37,573 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,577 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-08 22:12:37,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-12-08 22:12:37,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,578 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:37,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,578 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,580 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,591 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:37,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,592 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,592 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,596 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,596 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:37,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,597 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 22:12:37,597 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,599 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 22:12:37,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,626 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,626 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:37,626 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,627 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,632 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:37,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,632 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,633 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,637 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:37,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,637 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,638 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,642 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:37,642 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,642 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,643 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,645 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,645 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:37,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,645 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:37,645 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,646 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:37,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,654 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-08 22:12:37,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,654 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,655 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,655 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,657 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,657 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,665 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,665 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,665 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,666 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,669 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,669 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 22:12:37,669 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,672 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 22:12:37,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,693 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,693 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,693 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,694 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,694 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,695 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,699 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,699 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,699 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,700 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,700 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,703 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,703 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,703 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,703 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,706 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,707 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,707 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:37,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,708 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,708 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,708 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:37,708 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:37,709 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 22:12:37,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,715 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-08 22:12:37,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,716 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,716 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,717 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,717 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,723 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,723 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,723 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,724 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,725 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,725 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,726 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 22:12:37,726 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,726 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 22:12:37,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,737 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,737 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,737 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,737 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,737 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,740 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,740 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,740 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,741 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,742 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,742 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,743 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,743 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,744 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,744 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,745 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,745 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,745 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,745 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:37,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,746 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:37,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,747 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:37,747 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:37,747 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:37,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,750 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-08 22:12:37,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,751 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,751 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:37,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:37,752 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,768 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,769 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,769 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:37,769 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:37,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,772 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,772 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,772 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,772 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-12-08 22:12:37,772 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:37,773 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-12-08 22:12:37,773 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,814 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,814 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,814 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:37,815 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:37,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,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-12-08 22:12:37,820 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,820 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,820 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:37,820 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:37,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,822 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,823 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,823 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:37,824 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:37,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,826 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:37,826 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:37,827 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:37,827 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:37,829 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:37,829 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:37,829 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:37,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:37,829 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:37,829 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:37,830 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 22:12:37,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:37,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:37,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:12:37,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:12:37,845 INFO L87 Difference]: Start difference. First operand 226 states. Second operand 3 states. [2018-12-08 22:12:38,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:38,313 INFO L93 Difference]: Finished difference Result 379 states and 480 transitions. [2018-12-08 22:12:38,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:12:38,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 379 states and 480 transitions. [2018-12-08 22:12:38,317 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 304 [2018-12-08 22:12:38,322 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 379 states to 306 states and 407 transitions. [2018-12-08 22:12:38,322 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 306 [2018-12-08 22:12:38,323 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 306 [2018-12-08 22:12:38,323 INFO L73 IsDeterministic]: Start isDeterministic. Operand 306 states and 407 transitions. [2018-12-08 22:12:38,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 22:12:38,325 INFO L705 BuchiCegarLoop]: Abstraction has 306 states and 407 transitions. [2018-12-08 22:12:38,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states and 407 transitions. [2018-12-08 22:12:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-12-08 22:12:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-12-08 22:12:38,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 405 transitions. [2018-12-08 22:12:38,349 INFO L728 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-08 22:12:38,349 INFO L608 BuchiCegarLoop]: Abstraction has 305 states and 405 transitions. [2018-12-08 22:12:38,349 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 22:12:38,350 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 305 states and 405 transitions. [2018-12-08 22:12:38,351 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 303 [2018-12-08 22:12:38,351 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:12:38,351 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:12:38,351 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 22:12:38,352 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:38,352 INFO L794 eck$LassoCheckResult]: Stem: 764#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 635#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 636#L606-2 [2018-12-08 22:12:38,352 INFO L796 eck$LassoCheckResult]: Loop: 636#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 721#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 752#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 758#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 789#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 713#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 714#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 707#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 638#L54 assume (((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 639#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 636#L606-2 [2018-12-08 22:12:38,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:38,352 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-12-08 22:12:38,352 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:38,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:38,353 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:38,353 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:38,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:38,358 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:38,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1948456188, now seen corresponding path program 1 times [2018-12-08 22:12:38,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:38,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:38,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:38,359 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:12:38,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:38,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:38,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:38,366 INFO L82 PathProgramCache]: Analyzing trace with hash -141898178, now seen corresponding path program 1 times [2018-12-08 22:12:38,366 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:38,366 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:38,366 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:38,366 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:38,367 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:38,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:38,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:38,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:38,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-08 22:12:38,470 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 22:12:38,471 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 22:12:38,471 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 22:12:38,471 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 22:12:38,471 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 22:12:38,471 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:38,471 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 22:12:38,471 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 22:12:38,471 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label10_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-08 22:12:38,471 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 22:12:38,471 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 22:12:38,472 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,477 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,480 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,484 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,489 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,584 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 22:12:38,584 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:38,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:38,586 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:38,588 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:38,588 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:38,612 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:38,612 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:38,615 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:38,615 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:38,631 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:38,631 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:38,633 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:38,633 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=4} Honda state: {~a19~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:38,649 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:38,649 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:38,651 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:38,651 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:38,666 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:38,666 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:38,669 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:38,669 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:38,683 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:38,684 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:38,703 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 22:12:38,703 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:38,723 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-08 22:12:38,724 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 22:12:38,724 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 22:12:38,724 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 22:12:38,725 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 22:12:38,725 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 22:12:38,725 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:38,725 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 22:12:38,725 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 22:12:38,725 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label10_true-unreach-call_false-termination.c_Iteration2_Loop [2018-12-08 22:12:38,725 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 22:12:38,725 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 22:12:38,727 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,729 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:38,850 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 22:12:38,850 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 22:12:38,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,851 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:38,851 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:38,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,853 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,853 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,854 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,854 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,854 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:38,854 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,854 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,855 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:38,856 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:38,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,857 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,857 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:38,857 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:38,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,858 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,858 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,858 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,858 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,859 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,859 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,859 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:38,859 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,859 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,861 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,861 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:38,862 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,862 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,864 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,864 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,864 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,865 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:38,865 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:38,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,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-12-08 22:12:38,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,867 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,867 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 22:12:38,867 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 22:12:38,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,869 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 22:12:38,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,870 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,870 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:38,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,872 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,872 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,872 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:38,872 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,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-12-08 22:12:38,873 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,873 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,873 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,874 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:38,874 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,874 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,875 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,875 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,875 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,875 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,875 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:38,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,877 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,878 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,878 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,878 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:38,878 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,881 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,881 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,881 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:38,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,885 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,885 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:38,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,889 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,889 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:38,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,890 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 22:12:38,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,891 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,891 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,893 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,893 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,894 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:38,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,895 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,895 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,897 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,897 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,899 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,899 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,899 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,899 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:38,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,902 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,903 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,903 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,903 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:38,903 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,907 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,908 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,911 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,911 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,911 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,913 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 22:12:38,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,914 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:38,914 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:38,914 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,916 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,916 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,917 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:38,917 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 22:12:38,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,918 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:38,918 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:38,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,920 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:38,920 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:38,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,921 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,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-12-08 22:12:38,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,922 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,922 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:38,923 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 22:12:38,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,926 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,926 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:38,927 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 22:12:38,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,932 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:38,932 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:38,932 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,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-12-08 22:12:38,935 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 22:12:38,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,936 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:38,936 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:38,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,938 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 22:12:38,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,939 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:38,939 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,939 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,940 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:38,940 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,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-12-08 22:12:38,942 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,942 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:38,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,942 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,942 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,943 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:38,943 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,944 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,944 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:38,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,944 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,945 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:38,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,945 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,946 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:38,946 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,946 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,947 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:38,947 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,948 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,949 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,949 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:38,949 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,949 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,949 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,949 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,950 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:38,950 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,953 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,953 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:38,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,954 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,954 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,954 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:38,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,960 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,960 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,960 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:38,960 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,960 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,961 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,961 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:38,961 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,967 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:38,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,967 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 22:12:38,968 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 22:12:38,968 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,970 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,970 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-08 22:12:38,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,970 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,970 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:38,971 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,971 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,971 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,971 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,971 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,974 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,974 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:38,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,974 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,974 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,975 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:38,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,977 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:38,977 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,977 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,977 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,979 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,979 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:38,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:38,979 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,980 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:38,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,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-12-08 22:12:38,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,983 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:38,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,983 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,983 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,984 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:38,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:38,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:38,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:38,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:38,990 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:38,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:38,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:38,990 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:38,990 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:38,991 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:38,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,000 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,001 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:39,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,001 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:39,002 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:39,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,007 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,007 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-08 22:12:39,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,008 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:39,008 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:39,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,012 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-08 22:12:39,012 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,012 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,013 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:39,013 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:39,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,017 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,017 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,018 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:39,018 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:39,019 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 22:12:39,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,020 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,020 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,020 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,021 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:39,021 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:39,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,023 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,023 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:39,024 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:39,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,029 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,029 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:39,029 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:39,031 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 22:12:39,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,040 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,040 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,041 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:39,041 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:39,043 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-08 22:12:39,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,062 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,063 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:39,064 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:39,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,074 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,074 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 22:12:39,076 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 22:12:39,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,081 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,081 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-08 22:12:39,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,082 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,082 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:39,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,083 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:39,083 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:39,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,085 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,086 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:39,086 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,086 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:39,086 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:39,086 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:39,087 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,088 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,089 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,089 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:39,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,089 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:39,090 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:39,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,092 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,092 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:39,092 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,092 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:39,092 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:39,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,094 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,094 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,094 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:39,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,095 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:39,095 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:39,095 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:39,095 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,100 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,100 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:39,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,100 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:39,100 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:39,101 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 22:12:39,101 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,107 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:39,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,108 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:39,108 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:39,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,115 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,115 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 22:12:39,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,116 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 22:12:39,116 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 22:12:39,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,119 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-08 22:12:39,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,120 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,120 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,120 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:39,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:39,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,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-12-08 22:12:39,123 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,123 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,124 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:39,124 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:39,124 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 22:12:39,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,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-12-08 22:12:39,127 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,127 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,128 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:39,128 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:39,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,131 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,131 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,132 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:39,132 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:39,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,135 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,135 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,136 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:39,136 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:39,137 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 22:12:39,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,150 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,150 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,150 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,150 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,150 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 22:12:39,150 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:39,152 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 22:12:39,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,206 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,207 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,207 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,207 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,207 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,207 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:39,209 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:39,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 22:12:39,222 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 22:12:39,223 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-08 22:12:39,223 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 22:12:39,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 22:12:39,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 22:12:39,223 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-08 22:12:39,224 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 22:12:39,224 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 22:12:39,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 22:12:39,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:12:39,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:12:39,229 INFO L87 Difference]: Start difference. First operand 305 states and 405 transitions. cyclomatic complexity: 101 Second operand 3 states. [2018-12-08 22:12:39,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:39,501 INFO L93 Difference]: Finished difference Result 590 states and 749 transitions. [2018-12-08 22:12:39,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:12:39,502 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 590 states and 749 transitions. [2018-12-08 22:12:39,504 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-08 22:12:39,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 590 states to 590 states and 749 transitions. [2018-12-08 22:12:39,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 590 [2018-12-08 22:12:39,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 590 [2018-12-08 22:12:39,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 590 states and 749 transitions. [2018-12-08 22:12:39,508 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 22:12:39,508 INFO L705 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-08 22:12:39,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states and 749 transitions. [2018-12-08 22:12:39,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2018-12-08 22:12:39,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2018-12-08 22:12:39,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 749 transitions. [2018-12-08 22:12:39,519 INFO L728 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-08 22:12:39,519 INFO L608 BuchiCegarLoop]: Abstraction has 590 states and 749 transitions. [2018-12-08 22:12:39,519 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 22:12:39,519 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 590 states and 749 transitions. [2018-12-08 22:12:39,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-12-08 22:12:39,521 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:12:39,521 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:12:39,521 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 22:12:39,521 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:39,521 INFO L794 eck$LassoCheckResult]: Stem: 1666#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1539#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1540#L606-2 [2018-12-08 22:12:39,522 INFO L796 eck$LassoCheckResult]: Loop: 1540#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1627#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1657#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1663#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 1536#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1898#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1894#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1890#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 1695#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 1674#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 1675#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1848#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 1844#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 1840#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 1836#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 1832#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 1828#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 1824#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 1820#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1815#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 1814#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 1745#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 1746#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 1806#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 1805#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 1804#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 1803#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 1743#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 1744#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 1797#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 1793#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 1788#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 1787#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 1786#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 1784#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 1782#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 1777#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 1774#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 1773#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 1772#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 1771#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 1769#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 1767#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 1708#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 1709#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 1872#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 1868#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 1864#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 1862#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 1861#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 1859#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 1857#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 1855#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 1853#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1679#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1540#L606-2 [2018-12-08 22:12:39,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:39,522 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-12-08 22:12:39,522 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:39,522 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:39,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:39,523 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:39,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:39,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:39,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:39,526 INFO L82 PathProgramCache]: Analyzing trace with hash -695559695, now seen corresponding path program 1 times [2018-12-08 22:12:39,526 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:39,526 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:39,526 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:12:39,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:39,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:39,572 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:39,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-12-08 22:12:39,572 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 22:12:39,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 22:12:39,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-12-08 22:12:39,572 INFO L87 Difference]: Start difference. First operand 590 states and 749 transitions. cyclomatic complexity: 160 Second operand 4 states. [2018-12-08 22:12:40,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:40,009 INFO L93 Difference]: Finished difference Result 1154 states and 1436 transitions. [2018-12-08 22:12:40,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-08 22:12:40,010 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1154 states and 1436 transitions. [2018-12-08 22:12:40,013 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1150 [2018-12-08 22:12:40,016 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1154 states to 1154 states and 1436 transitions. [2018-12-08 22:12:40,016 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1154 [2018-12-08 22:12:40,017 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1154 [2018-12-08 22:12:40,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1154 states and 1436 transitions. [2018-12-08 22:12:40,018 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 22:12:40,018 INFO L705 BuchiCegarLoop]: Abstraction has 1154 states and 1436 transitions. [2018-12-08 22:12:40,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states and 1436 transitions. [2018-12-08 22:12:40,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1151. [2018-12-08 22:12:40,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1151 states. [2018-12-08 22:12:40,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1151 states to 1151 states and 1430 transitions. [2018-12-08 22:12:40,036 INFO L728 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-08 22:12:40,036 INFO L608 BuchiCegarLoop]: Abstraction has 1151 states and 1430 transitions. [2018-12-08 22:12:40,036 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 22:12:40,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1151 states and 1430 transitions. [2018-12-08 22:12:40,039 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1147 [2018-12-08 22:12:40,039 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:12:40,039 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:12:40,041 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 22:12:40,041 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:40,041 INFO L794 eck$LassoCheckResult]: Stem: 3434#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3291#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3292#L606-2 [2018-12-08 22:12:40,041 INFO L796 eck$LassoCheckResult]: Loop: 3292#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3683#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3682#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3681#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3680#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3679#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3678#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3677#L50 assume 1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3288#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3909#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3904#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3892#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3338#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3875#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 3872#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 3869#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 3866#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 3863#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 3859#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3857#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 3856#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 3855#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 3850#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 3849#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 3848#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 3847#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 3845#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3843#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 3841#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 3839#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 3837#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 3835#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 3833#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 3831#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 3829#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 3827#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 3825#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 3823#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 3821#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 3819#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 3817#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 3815#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 3813#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 3811#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 3809#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 3807#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 3805#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 3803#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 3801#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 3799#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 3797#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 3795#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 3793#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 3791#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 3789#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 3787#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 3785#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 3783#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 3781#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 3779#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 3772#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 3685#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 3684#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3292#L606-2 [2018-12-08 22:12:40,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,041 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-12-08 22:12:40,041 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:40,041 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:40,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:40,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:40,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,045 INFO L82 PathProgramCache]: Analyzing trace with hash -917902191, now seen corresponding path program 1 times [2018-12-08 22:12:40,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:40,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:12:40,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:40,062 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 22:12:40,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:40,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 22:12:40,063 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 22:12:40,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:12:40,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:12:40,063 INFO L87 Difference]: Start difference. First operand 1151 states and 1430 transitions. cyclomatic complexity: 281 Second operand 3 states. [2018-12-08 22:12:40,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:40,333 INFO L93 Difference]: Finished difference Result 1291 states and 1575 transitions. [2018-12-08 22:12:40,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:12:40,334 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1291 states and 1575 transitions. [2018-12-08 22:12:40,338 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-08 22:12:40,342 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-08 22:12:40,342 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1291 [2018-12-08 22:12:40,343 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1291 [2018-12-08 22:12:40,344 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1291 states and 1575 transitions. [2018-12-08 22:12:40,345 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 22:12:40,345 INFO L705 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-08 22:12:40,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1291 states and 1575 transitions. [2018-12-08 22:12:40,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1291 to 1291. [2018-12-08 22:12:40,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1291 states. [2018-12-08 22:12:40,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1291 states to 1291 states and 1575 transitions. [2018-12-08 22:12:40,361 INFO L728 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-08 22:12:40,361 INFO L608 BuchiCegarLoop]: Abstraction has 1291 states and 1575 transitions. [2018-12-08 22:12:40,361 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 22:12:40,361 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1291 states and 1575 transitions. [2018-12-08 22:12:40,366 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-08 22:12:40,366 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:12:40,366 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:12:40,367 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 22:12:40,367 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:40,368 INFO L794 eck$LassoCheckResult]: Stem: 5882#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 5738#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 5739#L606-2 [2018-12-08 22:12:40,368 INFO L796 eck$LassoCheckResult]: Loop: 5739#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6148#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6147#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6146#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6145#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6144#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6143#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6142#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6141#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6140#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6139#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6138#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6137#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6136#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6135#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6134#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6133#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6132#L106 assume (1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 5812#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6335#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6332#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6329#L30 assume ((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 5786#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6333#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6330#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6327#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 6324#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 6321#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 6318#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6316#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 6315#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 6314#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 6313#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 6312#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 6311#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 6310#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 6309#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6307#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 6305#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 6303#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 6301#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 6299#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 6297#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 6295#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 6293#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 6291#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 6289#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 6287#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 6285#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 6283#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 6281#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 6279#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 6277#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 6275#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 6273#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 6271#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 6269#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 6267#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 6265#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 6263#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 6261#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 6259#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 6257#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 6255#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 6253#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 6250#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 6248#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 6246#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 6244#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 6241#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 6236#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 6150#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6149#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 5739#L606-2 [2018-12-08 22:12:40,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,368 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-12-08 22:12:40,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:40,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:40,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:40,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,373 INFO L82 PathProgramCache]: Analyzing trace with hash -925782543, now seen corresponding path program 1 times [2018-12-08 22:12:40,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:40,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:40,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,373 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:12:40,373 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:40,393 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 22:12:40,393 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:40,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 22:12:40,394 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 22:12:40,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:12:40,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:12:40,394 INFO L87 Difference]: Start difference. First operand 1291 states and 1575 transitions. cyclomatic complexity: 286 Second operand 3 states. [2018-12-08 22:12:40,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:40,650 INFO L93 Difference]: Finished difference Result 1290 states and 1468 transitions. [2018-12-08 22:12:40,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:12:40,650 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1290 states and 1468 transitions. [2018-12-08 22:12:40,656 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-08 22:12:40,660 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-08 22:12:40,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1290 [2018-12-08 22:12:40,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1290 [2018-12-08 22:12:40,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1290 states and 1468 transitions. [2018-12-08 22:12:40,663 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 22:12:40,663 INFO L705 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-08 22:12:40,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1290 states and 1468 transitions. [2018-12-08 22:12:40,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1290 to 1290. [2018-12-08 22:12:40,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1290 states. [2018-12-08 22:12:40,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1290 states to 1290 states and 1468 transitions. [2018-12-08 22:12:40,678 INFO L728 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-08 22:12:40,678 INFO L608 BuchiCegarLoop]: Abstraction has 1290 states and 1468 transitions. [2018-12-08 22:12:40,678 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 22:12:40,678 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1290 states and 1468 transitions. [2018-12-08 22:12:40,682 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1287 [2018-12-08 22:12:40,683 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:12:40,683 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:12:40,684 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 22:12:40,684 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:40,684 INFO L794 eck$LassoCheckResult]: Stem: 8462#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 8325#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 8326#L606-2 [2018-12-08 22:12:40,684 INFO L796 eck$LassoCheckResult]: Loop: 8326#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8712#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8710#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8708#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8706#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8704#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8702#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8685#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8683#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8680#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8677#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8674#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8671#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8668#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8665#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8662#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8659#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8656#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8652#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8649#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8646#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8643#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8640#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8637#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8634#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8631#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8628#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8625#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8622#L165 assume (1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 8374#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8682#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 8679#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 8676#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 8673#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 8670#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 8667#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8664#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 8661#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 8658#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 8654#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 8651#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 8648#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 8645#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 8642#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8639#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 8636#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 8633#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 8630#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 8627#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 8624#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 8621#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 8618#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 8615#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 8612#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 8609#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 8606#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 8603#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 8600#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 8597#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 8594#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 8591#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 8588#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 8585#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 8582#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 8579#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 8576#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 8573#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 8566#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 8564#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 8561#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 8558#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 8555#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 8552#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 8549#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 8546#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 8543#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 8540#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 8536#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 8532#L253 assume (9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 8533#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 8326#L606-2 [2018-12-08 22:12:40,685 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,685 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-12-08 22:12:40,685 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:40,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:40,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,685 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:40,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:40,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,689 INFO L82 PathProgramCache]: Analyzing trace with hash -568851643, now seen corresponding path program 1 times [2018-12-08 22:12:40,689 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:40,689 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:40,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,690 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 22:12:40,690 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:40,732 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:40,732 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:40,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 22:12:40,732 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 22:12:40,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 22:12:40,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 22:12:40,733 INFO L87 Difference]: Start difference. First operand 1290 states and 1468 transitions. cyclomatic complexity: 180 Second operand 3 states. [2018-12-08 22:12:40,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:40,891 INFO L93 Difference]: Finished difference Result 1279 states and 1424 transitions. [2018-12-08 22:12:40,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 22:12:40,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1279 states and 1424 transitions. [2018-12-08 22:12:40,894 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-08 22:12:40,897 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-08 22:12:40,897 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1279 [2018-12-08 22:12:40,898 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1279 [2018-12-08 22:12:40,898 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1279 states and 1424 transitions. [2018-12-08 22:12:40,899 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 22:12:40,899 INFO L705 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-08 22:12:40,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1279 states and 1424 transitions. [2018-12-08 22:12:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1279 to 1279. [2018-12-08 22:12:40,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1279 states. [2018-12-08 22:12:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1279 states to 1279 states and 1424 transitions. [2018-12-08 22:12:40,909 INFO L728 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-08 22:12:40,909 INFO L608 BuchiCegarLoop]: Abstraction has 1279 states and 1424 transitions. [2018-12-08 22:12:40,909 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 22:12:40,909 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1279 states and 1424 transitions. [2018-12-08 22:12:40,912 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1276 [2018-12-08 22:12:40,912 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:12:40,912 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:12:40,913 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 22:12:40,913 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:40,913 INFO L794 eck$LassoCheckResult]: Stem: 11021#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 10900#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 10901#L606-2 [2018-12-08 22:12:40,914 INFO L796 eck$LassoCheckResult]: Loop: 10901#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 11770#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 11768#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 11766#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 11765#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 11763#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 11761#L47 assume !(((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0); 11726#L50 assume !(1 == ~a19~0 && !(1 == ~a25~0) && 1 == ~a21~0 && ((1 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a11~0)) && 7 == ~a28~0); 11727#L54 assume !((((!(1 == ~a19~0) && 1 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11802#L59 assume !(1 == ~a19~0 && (((1 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0)))) && 1 == ~a11~0) && 1 == ~a21~0) && 9 == ~a17~0); 11800#L65 assume !(1 == ~a19~0 && (8 == ~a17~0 && (6 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a11~0)) && 1 == ~a21~0); 11798#L69 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 1 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && !(1 == ~a19~0)) && 8 == ~a17~0); 11796#L74 assume !(!(1 == ~a19~0) && (((8 == ~a17~0 && 1 == ~a25~0 && 3 == calculate_output_~input) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a21~0); 11794#L82 assume !(((!(1 == ~a19~0) && 1 == ~a21~0 && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (7 == ~a28~0 && !(1 == ~a25~0))) && 4 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 11792#L91 assume !(8 == ~a17~0 && 1 == ~a21~0 && 1 == ~a25~0 && 1 == ~a19~0 && !(1 == ~a11~0) && 11 == ~a28~0 && 3 == calculate_output_~input); 11790#L95 assume !(9 == ~a28~0 && ((!(1 == ~a19~0) && (3 == calculate_output_~input && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0); 11788#L99 assume !((!(1 == ~a11~0) && (11 == ~a28~0 && 1 == ~a25~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 1 == ~a21~0); 11786#L106 assume !((1 == ~a11~0 && ((((1 == ~a25~0 && 8 == ~a28~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) && 6 == calculate_output_~input) && 1 == ~a19~0) && 9 == ~a17~0) && 1 == ~a21~0); 11784#L113 assume !(8 == ~a17~0 && 1 == ~a21~0 && !(1 == ~a11~0) && !(1 == ~a19~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input); 11782#L119 assume !((((1 == ~a21~0 && 10 == ~a28~0 && 1 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a17~0) && !(1 == ~a19~0)); 11780#L123 assume !(!(1 == ~a11~0) && !(1 == ~a19~0) && (8 == ~a17~0 && 6 == calculate_output_~input && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (8 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a21~0); 11778#L130 assume !(((8 == ~a17~0 && !(1 == ~a19~0) && (6 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 9 == ~a28~0); 11776#L134 assume !(!(1 == ~a11~0) && (!(1 == ~a25~0) && (1 == ~a21~0 && 1 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a17~0) && 11 == ~a28~0); 11774#L139 assume !((1 == ~a11~0 && (1 == ~a19~0 && 1 == ~a21~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 4 == calculate_output_~input) && 9 == ~a17~0) && 9 == ~a28~0); 11772#L143 assume !((!(1 == ~a11~0) && 9 == ~a28~0 && ((!(1 == ~a19~0) && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11771#L148 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && (((7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0)) || (8 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && !(1 == ~a19~0)) && 1 == ~a21~0); 11769#L154 assume !(1 == ~a21~0 && !(1 == ~a19~0) && ((5 == calculate_output_~input && ((8 == ~a28~0 && 1 == ~a25~0) || (1 == ~a25~0 && 7 == ~a28~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && !(1 == ~a11~0)) && 8 == ~a17~0); 11767#L159 assume !((9 == ~a17~0 && (8 == ~a28~0 && (1 == calculate_output_~input && 1 == ~a19~0) && !(1 == ~a25~0)) && 1 == ~a11~0) && 1 == ~a21~0); 11728#L165 assume !((1 == ~a21~0 && 1 == ~a19~0 && 7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 3 == calculate_output_~input) && !(1 == ~a11~0)); 11729#L169 assume !(11 == ~a28~0 && (8 == ~a17~0 && ((6 == calculate_output_~input && 1 == ~a21~0) && 1 == ~a19~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)); 12096#L175 assume !((!(1 == ~a11~0) && (8 == ~a17~0 && 1 == ~a21~0 && 3 == calculate_output_~input && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a25~0); 12095#L179 assume !((1 == ~a21~0 && (1 == ~a19~0 && (((1 == ~a25~0 && 7 == ~a28~0) || (7 == ~a28~0 && !(1 == ~a25~0))) || (1 == ~a25~0 && 8 == ~a28~0)) && 4 == calculate_output_~input) && 1 == ~a11~0) && 9 == ~a17~0); 12094#L185 assume !(((!(1 == ~a11~0) && 8 == ~a17~0 && (4 == calculate_output_~input && 1 == ~a19~0) && 8 == ~a28~0) && 1 == ~a21~0) && 1 == ~a25~0); 12093#L187 assume !(1 == ~a19~0 && ((((4 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 12092#L189 assume !(8 == ~a17~0 && ((((1 == calculate_output_~input && 1 == ~a21~0) && !(1 == ~a11~0)) && 1 == ~a19~0) && !(1 == ~a25~0)) && 9 == ~a28~0); 12091#L191 assume !((((((4 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a21~0) && 8 == ~a17~0) && 10 == ~a28~0) && 1 == ~a19~0); 12089#L194 assume !((!(1 == ~a25~0) && 1 == ~a11~0 && 8 == ~a28~0 && (9 == ~a17~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 1 == ~a21~0); 12087#L198 assume !(!(1 == ~a19~0) && 8 == ~a17~0 && 10 == ~a28~0 && (1 == ~a25~0 && !(1 == ~a11~0) && 5 == calculate_output_~input) && 1 == ~a21~0); 12085#L202 assume !((((1 == ~a21~0 && 1 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 12083#L212 assume !(1 == ~a21~0 && ((1 == ~a19~0 && 1 == ~a25~0 && 11 == ~a28~0 && 6 == calculate_output_~input) && !(1 == ~a11~0)) && 8 == ~a17~0); 12081#L215 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && 10 == ~a28~0 && (((1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 12078#L218 assume !((((9 == ~a17~0 && ((1 == ~a25~0 || !(1 == ~a25~0)) && 6 == calculate_output_~input) && 1 == ~a11~0) && 1 == ~a19~0) && 1 == ~a21~0) && 9 == ~a28~0); 11924#L223 assume !((8 == ~a17~0 && (((6 == calculate_output_~input && 1 == ~a25~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a21~0); 11922#L225 assume !((!(1 == ~a19~0) && 8 == ~a17~0 && !(1 == ~a11~0) && 1 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0); 11921#L232 assume !((((((1 == calculate_output_~input && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && !(1 == ~a25~0)) && 8 == ~a17~0) && !(1 == ~a11~0)); 11735#L234 assume !(8 == ~a17~0 && ((!(1 == ~a11~0) && (!(1 == ~a25~0) && 4 == calculate_output_~input) && 1 == ~a19~0) && 7 == ~a28~0) && 1 == ~a21~0); 11736#L237 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && (((!(1 == ~a25~0) && 11 == ~a28~0) || (!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) && 3 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)); 11746#L248 assume !((((!(1 == ~a11~0) && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a19~0)) && 8 == ~a17~0); 11744#L253 assume !((9 == ~a17~0 && (((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a11~0) && 1 == ~a21~0) && 1 == ~a19~0) && 9 == ~a28~0); 11742#L259 assume !(!(1 == ~a11~0) && 1 == ~a19~0 && (((9 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)); 11740#L261 assume !(9 == ~a17~0 && 1 == ~a21~0 && 1 == ~a11~0 && (3 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a19~0); 11719#L276 assume !(7 == ~a28~0 && 8 == ~a17~0 && !(1 == ~a25~0) && 1 == ~a21~0 && 1 == ~a19~0 && 5 == calculate_output_~input && !(1 == ~a11~0)); 11049#L280 assume !(8 == ~a28~0 && 1 == ~a21~0 && (!(1 == ~a11~0) && (1 == calculate_output_~input && 8 == ~a17~0) && 1 == ~a19~0) && 1 == ~a25~0); 11028#L283 assume !((((8 == ~a17~0 && (6 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && 1 == ~a21~0) && 10 == ~a28~0) && !(1 == ~a11~0)) && 1 == ~a19~0); 11015#L286 assume !((!(1 == ~a11~0) && (!(1 == ~a19~0) && ((!(1 == ~a25~0) && 11 == ~a28~0) || (10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0); 11016#L291 assume !(8 == ~a17~0 && (1 == ~a21~0 && !(1 == ~a11~0) && 1 == ~a25~0 && 8 == ~a28~0 && 6 == calculate_output_~input) && 1 == ~a19~0); 10913#L293 assume !((1 == ~a19~0 && 8 == ~a17~0 && ((!(1 == ~a25~0) && 5 == calculate_output_~input) && 1 == ~a21~0) && !(1 == ~a11~0)) && 11 == ~a28~0); 10914#L297 assume !(1 == ~a11~0 && (9 == ~a17~0 && 9 == ~a28~0 && 1 == ~a19~0 && (1 == ~a25~0 || !(1 == ~a25~0)) && 5 == calculate_output_~input) && 1 == ~a21~0); 10969#L309 assume !((((((3 == calculate_output_~input && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a25~0)) && 11 == ~a28~0) && !(1 == ~a11~0)); 10970#L314 assume !(1 == ~a19~0 && 1 == ~a21~0 && ((5 == calculate_output_~input && ((1 == ~a25~0 && 8 == ~a28~0) || (7 == ~a28~0 && 1 == ~a25~0) || (!(1 == ~a25~0) && 7 == ~a28~0))) && 1 == ~a11~0) && 9 == ~a17~0); 10975#L328 assume !((1 == ~a19~0 && ((!(1 == ~a11~0) && (1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 10 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0); 10976#L331 assume !((!(1 == ~a11~0) && (((4 == calculate_output_~input && 8 == ~a17~0) && !(1 == ~a25~0)) && 1 == ~a21~0) && 11 == ~a28~0) && 1 == ~a19~0); 12158#L337 assume !(((!(1 == ~a19~0) && (4 == calculate_output_~input && (((!(1 == ~a25~0) && 10 == ~a28~0) || (11 == ~a28~0 && 1 == ~a25~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 11037#L349 assume !(!(1 == ~a11~0) && (8 == ~a17~0 && ((1 == ~a25~0 && 4 == calculate_output_~input) && 1 == ~a19~0) && 11 == ~a28~0) && 1 == ~a21~0); 10890#L354 assume !((((1 == ~a21~0 && ((8 == ~a28~0 && !(1 == ~a25~0)) || (9 == ~a28~0 && 1 == ~a25~0)) && 6 == calculate_output_~input) && !(1 == ~a11~0)) && !(1 == ~a19~0)) && 8 == ~a17~0); 10891#L361 assume !(1 == ~a19~0 && ((1 == ~a21~0 && (!(1 == ~a25~0) && 3 == calculate_output_~input) && 9 == ~a17~0) && 8 == ~a28~0) && 1 == ~a11~0); 10972#L368 assume !(8 == ~a17~0 && (1 == ~a21~0 && (5 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (9 == ~a28~0 && 1 == ~a25~0))) && 1 == ~a19~0) && !(1 == ~a11~0)); 10965#L375 assume !(1 == ~a19~0 && (((8 == ~a17~0 && 5 == calculate_output_~input && !(1 == ~a11~0)) && 1 == ~a21~0) && 1 == ~a25~0) && 8 == ~a28~0); 10956#L378 assume !(((!(1 == ~a11~0) && ((1 == ~a21~0 && 4 == calculate_output_~input) && 10 == ~a28~0) && 8 == ~a17~0) && !(1 == ~a19~0)) && 1 == ~a25~0); 10957#L380 assume !(8 == ~a28~0 && (1 == ~a19~0 && 1 == ~a11~0 && !(1 == ~a25~0) && 9 == ~a17~0 && 6 == calculate_output_~input) && 1 == ~a21~0); 10954#L389 assume !(!(1 == ~a11~0) && ((1 == ~a21~0 && 6 == calculate_output_~input && (((10 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 11 == ~a28~0)) || (!(1 == ~a25~0) && 11 == ~a28~0))) && 8 == ~a17~0) && !(1 == ~a19~0)); 10955#L394 assume !(((((!(1 == ~a25~0) && 1 == ~a19~0 && 3 == calculate_output_~input) && 9 == ~a28~0) && 1 == ~a21~0) && 8 == ~a17~0) && !(1 == ~a11~0)); 10886#L398 assume !((8 == ~a17~0 && ((4 == calculate_output_~input && ((8 == ~a28~0 && !(1 == ~a25~0)) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && !(1 == ~a19~0)) && !(1 == ~a11~0)); 10887#L402 assume !(((!(1 == ~a11~0) && ((1 == ~a19~0 && 5 == calculate_output_~input) && 8 == ~a17~0) && 1 == ~a21~0) && 9 == ~a28~0) && !(1 == ~a25~0)); 11000#L404 assume !((1 == ~a11~0 && 1 == ~a19~0 && 1 == ~a21~0 && (9 == ~a17~0 && 5 == calculate_output_~input) && !(1 == ~a25~0)) && 8 == ~a28~0); 11031#L407 assume !(!(1 == ~a11~0) && 1 == ~a21~0 && (1 == ~a19~0 && 8 == ~a17~0 && 1 == ~a25~0 && 5 == calculate_output_~input) && 11 == ~a28~0); 10884#L409 assume !(1 == ~a19~0 && 8 == ~a17~0 && ((((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0)) && 3 == calculate_output_~input) && !(1 == ~a11~0)) && 1 == ~a21~0); 10885#L414 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10924#L414-2 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10918#L417-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10888#L420-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10889#L423-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11036#L426-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11032#L429-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11025#L432-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11026#L435-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10995#L438-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10996#L441-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10953#L444-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10925#L447-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10917#L450-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10882#L453-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10883#L456-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11046#L459-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11029#L462-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11024#L465-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 10999#L468-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 10994#L471-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10958#L474-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 10951#L477-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 10952#L480-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12125#L483-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12124#L486-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12123#L489-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12122#L492-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12121#L495-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12120#L498-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 12119#L501-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12118#L504-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 12117#L507-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 8 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12116#L510-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12115#L513-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 12114#L516-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 12107#L519-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11936#L522-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 8 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11935#L525-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11934#L528-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11932#L531-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11931#L534-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11810#L537-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11809#L540-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11807#L543-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11805#L546-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11804#L549-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11803#L552-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11801#L555-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11799#L558-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11797#L561-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 11 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11795#L564-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11793#L567-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11791#L570-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11789#L573-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 7 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11787#L576-1 assume !(((((!(1 == ~a25~0) && !(1 == ~a11~0)) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11785#L579-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 8 == ~a17~0); 11783#L582-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 8 == ~a17~0); 11781#L585-1 assume !(((((1 == ~a25~0 && 1 == ~a11~0) && 11 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11779#L588-1 assume !(((((!(1 == ~a25~0) && 1 == ~a11~0) && 10 == ~a28~0) && 1 == ~a19~0) && 1 == ~a21~0) && 7 == ~a17~0); 11777#L591-1 assume !(((((1 == ~a25~0 && !(1 == ~a11~0)) && 9 == ~a28~0) && !(1 == ~a19~0)) && 1 == ~a21~0) && 7 == ~a17~0); 11775#L594-1 calculate_output_#res := -2; 11773#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 10901#L606-2 [2018-12-08 22:12:40,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-12-08 22:12:40,914 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:40,915 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:40,915 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:40,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,918 INFO L82 PathProgramCache]: Analyzing trace with hash 2053340219, now seen corresponding path program 1 times [2018-12-08 22:12:40,918 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:40,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:40,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,919 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:40,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:40,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:40,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:40,949 INFO L82 PathProgramCache]: Analyzing trace with hash 41143549, now seen corresponding path program 1 times [2018-12-08 22:12:40,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:40,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:40,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:40,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 22:12:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 22:12:41,243 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 22:12:41,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-12-08 22:12:41,936 WARN L180 SmtUtils]: Spent 683.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-12-08 22:12:41,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-08 22:12:41,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-12-08 22:12:41,998 INFO L87 Difference]: Start difference. First operand 1279 states and 1424 transitions. cyclomatic complexity: 148 Second operand 10 states. [2018-12-08 22:12:42,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 22:12:42,449 INFO L93 Difference]: Finished difference Result 1225 states and 1369 transitions. [2018-12-08 22:12:42,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 22:12:42,449 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1225 states and 1369 transitions. [2018-12-08 22:12:42,452 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-08 22:12:42,456 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1225 states to 1191 states and 1335 transitions. [2018-12-08 22:12:42,456 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1191 [2018-12-08 22:12:42,457 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1191 [2018-12-08 22:12:42,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1191 states and 1335 transitions. [2018-12-08 22:12:42,458 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 22:12:42,458 INFO L705 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-08 22:12:42,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1191 states and 1335 transitions. [2018-12-08 22:12:42,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1191 to 1191. [2018-12-08 22:12:42,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2018-12-08 22:12:42,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1335 transitions. [2018-12-08 22:12:42,471 INFO L728 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-08 22:12:42,471 INFO L608 BuchiCegarLoop]: Abstraction has 1191 states and 1335 transitions. [2018-12-08 22:12:42,471 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 22:12:42,471 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1191 states and 1335 transitions. [2018-12-08 22:12:42,475 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1136 [2018-12-08 22:12:42,475 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 22:12:42,475 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 22:12:42,475 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-12-08 22:12:42,475 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 22:12:42,475 INFO L794 eck$LassoCheckResult]: Stem: 13549#ULTIMATE.startENTRY ~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 13429#L-1 havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 13430#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 14305#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 14303#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 14301#L35 assume 8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0);~a28~0 := 10;calculate_output_#res := 22; 13503#L597 [2018-12-08 22:12:42,476 INFO L796 eck$LassoCheckResult]: Loop: 13503#L597 main_#t~ret3 := calculate_output_#res;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 13504#L606-2 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13505#L611 assume !((((1 != main_~input~0 && 3 != main_~input~0) && 4 != main_~input~0) && 5 != main_~input~0) && 6 != main_~input~0);calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13539#L30 assume !(((!(1 == ~a11~0) && 1 == ~a19~0 && 4 == calculate_output_~input && ((!(1 == ~a25~0) && 8 == ~a28~0) || (1 == ~a25~0 && 9 == ~a28~0))) && 1 == ~a21~0) && 8 == ~a17~0); 13543#L35 assume !(8 == ~a17~0 && (((!(1 == ~a11~0) && 1 == ~a21~0 && 6 == calculate_output_~input) && 7 == ~a28~0) && 1 == ~a19~0) && !(1 == ~a25~0)); 13558#L38 assume !(1 == ~a21~0 && 1 == ~a19~0 && ((((1 == ~a25~0 || !(1 == ~a25~0)) && 3 == calculate_output_~input) && 9 == ~a17~0) && 1 == ~a11~0) && 9 == ~a28~0); 13498#L42 assume !(9 == ~a28~0 && !(1 == ~a19~0) && 1 == ~a21~0 && ((4 == calculate_output_~input && !(1 == ~a25~0)) && !(1 == ~a11~0)) && 8 == ~a17~0); 13499#L47 assume ((8 == ~a17~0 && ((1 == calculate_output_~input && (1 == ~a25~0 || !(1 == ~a25~0))) && !(1 == ~a11~0)) && 1 == ~a19~0) && 1 == ~a21~0) && 10 == ~a28~0;~a25~0 := 0;calculate_output_#res := -1; 13503#L597 [2018-12-08 22:12:42,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:42,476 INFO L82 PathProgramCache]: Analyzing trace with hash 889694475, now seen corresponding path program 1 times [2018-12-08 22:12:42,476 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:42,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:42,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:42,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:42,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:42,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:42,482 INFO L82 PathProgramCache]: Analyzing trace with hash 1141479969, now seen corresponding path program 1 times [2018-12-08 22:12:42,482 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:42,482 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:42,483 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:42,483 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:42,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:42,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 22:12:42,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2047121707, now seen corresponding path program 1 times [2018-12-08 22:12:42,488 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 22:12:42,488 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 22:12:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:42,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 22:12:42,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 22:12:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 22:12:42,629 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 22:12:42,630 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 22:12:42,630 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 22:12:42,630 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 22:12:42,630 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-08 22:12:42,630 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,630 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 22:12:42,630 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 22:12:42,630 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label10_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-12-08 22:12:42,630 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 22:12:42,630 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 22:12:42,631 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,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-12-08 22:12:42,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,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-12-08 22:12:42,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,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-12-08 22:12:42,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 22:12:42,794 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 22:12:42,794 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,796 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,796 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,798 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,798 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,812 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,813 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,815 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,815 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,831 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,832 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,833 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,833 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,848 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,848 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,850 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,850 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,865 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,865 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,867 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,867 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,882 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,882 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,884 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,884 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,899 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,899 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,901 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,901 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,916 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,916 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,918 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,918 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,933 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,933 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,935 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,935 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,950 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,952 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,952 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,967 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,967 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,969 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,969 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:42,984 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:42,984 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:42,986 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:42,986 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,001 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:43,001 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:43,003 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:43,003 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,019 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:43,019 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:43,021 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:43,021 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,035 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:43,035 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:43,037 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:43,037 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,051 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:43,052 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,069 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 22:12:43,070 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:43,218 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:43,218 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=-6, ULTIMATE.start_calculate_output_~input=2, ULTIMATE.start_main_~input~0=3, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=1, ULTIMATE.start_calculate_output_~input=-7, ULTIMATE.start_main_~input~0=-8, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [0, 11, 0] Nus: [0, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,233 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:43,233 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:43,235 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:43,235 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,250 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:43,250 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:43,251 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:43,252 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,266 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:43,266 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,283 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-08 22:12:43,283 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:43,416 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:43,416 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,431 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:43,431 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:43,433 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:43,433 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 22:12:43,448 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-08 22:12:43,448 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-08 22:12:43,450 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-08 22:12:43,450 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-12-08 22:12:43,480 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 10:12:43 BoogieIcfgContainer [2018-12-08 22:12:43,480 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 22:12:43,481 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 22:12:43,481 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 22:12:43,481 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 22:12:43,481 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 10:12:36" (3/4) ... [2018-12-08 22:12:43,483 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-08 22:12:43,510 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d42f1bb9-d2f8-42da-821d-9341eb833a40/bin-2019/uautomizer/witness.graphml [2018-12-08 22:12:43,510 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 22:12:43,510 INFO L168 Benchmark]: Toolchain (without parser) took 8097.43 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 490.2 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -173.7 MB). Peak memory consumption was 316.6 MB. Max. memory is 11.5 GB. [2018-12-08 22:12:43,511 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:12:43,511 INFO L168 Benchmark]: CACSL2BoogieTranslator took 312.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. [2018-12-08 22:12:43,511 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 22:12:43,511 INFO L168 Benchmark]: Boogie Preprocessor took 28.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-12-08 22:12:43,512 INFO L168 Benchmark]: RCFGBuilder took 592.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 981.0 MB in the end (delta: 96.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 11.5 GB. [2018-12-08 22:12:43,512 INFO L168 Benchmark]: BuchiAutomizer took 7086.02 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 394.3 MB). Free memory was 975.6 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 389.5 MB. Max. memory is 11.5 GB. [2018-12-08 22:12:43,512 INFO L168 Benchmark]: Witness Printer took 29.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 22:12:43,513 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.15 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 312.18 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 949.5 MB in the beginning and 1.1 GB in the end (delta: -138.5 MB). Peak memory consumption was 51.6 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 46.11 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.49 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 592.47 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 981.0 MB in the end (delta: 96.3 MB). Peak memory consumption was 96.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 7086.02 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 394.3 MB). Free memory was 975.6 MB in the beginning and 1.1 GB in the end (delta: -147.6 MB). Peak memory consumption was 389.5 MB. Max. memory is 11.5 GB. * Witness Printer took 29.38 ms. Allocated memory is still 1.5 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 7 terminating modules (7 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.7 modules have a trivial ranking function, the largest among these consists of 10 locations. The remainder module has 1191 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.0s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 4.4s. Construction of modules took 1.6s. Büchi inclusion checks took 0.7s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 4 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1291 states and ocurred in iteration 4. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 897 SDtfs, 1440 SDslu, 122 SDs, 0 SdLazy, 2979 SolverSat, 509 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time LassoAnalysisResults: nont1 unkn0 SFLI4 SFLT0 conc3 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital65 mio100 ax100 hnf103 lsp39 ukn90 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf93 smp100 dnf148 smp89 tf102 neg98 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 41ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.5s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6fcb7442=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9cd3132=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@6fcb7442=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@9cd3132=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@6fcb7442=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@9cd3132=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i -6*0^k + 1*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 3*0^k + -8*0^k, input=6 + sum_{k=0}^i 2*0^k + -7*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 5GEVs Lambdas: [0, 11, 0, 0, 0, 0] Mus: [0, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...