./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c -s /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/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 9fc45ae4ddf84075a39a55d475a45c859aa435e6 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 02:24:33,018 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 02:24:33,019 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 02:24:33,026 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 02:24:33,026 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 02:24:33,026 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 02:24:33,027 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 02:24:33,028 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 02:24:33,029 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 02:24:33,030 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 02:24:33,030 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 02:24:33,030 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 02:24:33,031 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 02:24:33,032 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 02:24:33,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 02:24:33,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 02:24:33,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 02:24:33,035 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 02:24:33,036 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 02:24:33,037 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 02:24:33,038 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 02:24:33,038 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 02:24:33,040 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 02:24:33,040 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 02:24:33,040 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 02:24:33,041 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 02:24:33,042 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 02:24:33,042 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 02:24:33,043 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 02:24:33,043 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 02:24:33,044 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 02:24:33,044 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 02:24:33,044 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 02:24:33,044 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 02:24:33,045 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 02:24:33,045 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 02:24:33,046 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-10 02:24:33,055 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 02:24:33,055 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 02:24:33,056 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 02:24:33,056 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 02:24:33,056 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 02:24:33,057 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 02:24:33,057 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 02:24:33,057 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 02:24:33,057 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 02:24:33,057 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 02:24:33,057 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 02:24:33,057 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 02:24:33,058 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 02:24:33,058 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 02:24:33,058 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 02:24:33,058 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 02:24:33,058 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 02:24:33,058 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 02:24:33,058 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 02:24:33,058 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 02:24:33,059 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 02:24:33,059 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 02:24:33,059 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 02:24:33,059 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 02:24:33,059 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 02:24:33,059 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 02:24:33,059 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 02:24:33,060 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 02:24:33,060 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 02:24:33,060 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 02:24:33,060 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 02:24:33,061 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_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/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 -> 9fc45ae4ddf84075a39a55d475a45c859aa435e6 [2018-11-10 02:24:33,083 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 02:24:33,093 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 02:24:33,095 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 02:24:33,096 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 02:24:33,096 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 02:24:33,096 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/../../sv-benchmarks/c/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c [2018-11-10 02:24:33,135 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/data/8a8849f72/8fa16bb3244c44e6a95e8aa882c9cce7/FLAGdcaca1be6 [2018-11-10 02:24:33,573 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 02:24:33,574 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/sv-benchmarks/c/eca-rers2012/Problem02_label36_true-unreach-call_false-termination.c [2018-11-10 02:24:33,583 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/data/8a8849f72/8fa16bb3244c44e6a95e8aa882c9cce7/FLAGdcaca1be6 [2018-11-10 02:24:33,595 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/data/8a8849f72/8fa16bb3244c44e6a95e8aa882c9cce7 [2018-11-10 02:24:33,598 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 02:24:33,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 02:24:33,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 02:24:33,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 02:24:33,603 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 02:24:33,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:33,606 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18da3d15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33, skipping insertion in model container [2018-11-10 02:24:33,606 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:33,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 02:24:33,644 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 02:24:33,871 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:24:33,873 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 02:24:33,941 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 02:24:33,953 INFO L193 MainTranslator]: Completed translation [2018-11-10 02:24:33,954 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33 WrapperNode [2018-11-10 02:24:33,954 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 02:24:33,954 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 02:24:33,954 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 02:24:33,955 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 02:24:33,962 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:33,973 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:34,051 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 02:24:34,051 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 02:24:34,051 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 02:24:34,051 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 02:24:34,057 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:34,057 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:34,060 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:34,061 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:34,073 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:34,082 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:34,086 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (1/1) ... [2018-11-10 02:24:34,091 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 02:24:34,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 02:24:34,091 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 02:24:34,091 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 02:24:34,092 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:34,138 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 02:24:34,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 02:24:34,974 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 02:24:34,974 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:24:34 BoogieIcfgContainer [2018-11-10 02:24:34,974 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 02:24:34,975 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 02:24:34,975 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 02:24:34,982 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 02:24:34,983 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:24:34,983 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 02:24:33" (1/3) ... [2018-11-10 02:24:34,984 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6c8dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:24:34, skipping insertion in model container [2018-11-10 02:24:34,984 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:24:34,984 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 02:24:33" (2/3) ... [2018-11-10 02:24:34,985 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@5e6c8dea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 02:24:34, skipping insertion in model container [2018-11-10 02:24:34,985 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 02:24:34,985 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:24:34" (3/3) ... [2018-11-10 02:24:34,986 INFO L375 chiAutomizerObserver]: Analyzing ICFG Problem02_label36_true-unreach-call_false-termination.c [2018-11-10 02:24:35,037 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 02:24:35,037 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 02:24:35,037 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 02:24:35,038 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 02:24:35,038 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 02:24:35,038 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 02:24:35,038 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 02:24:35,038 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 02:24:35,038 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 02:24:35,056 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 02:24:35,081 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 02:24:35,082 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:35,082 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:35,089 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:24:35,089 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:24:35,089 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 02:24:35,090 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 227 states. [2018-11-10 02:24:35,095 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 222 [2018-11-10 02:24:35,096 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:35,096 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:35,097 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:24:35,097 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-10 02:24:35,104 INFO L793 eck$LassoCheckResult]: Stem: 78#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 167#L606-3true [2018-11-10 02:24:35,104 INFO L795 eck$LassoCheckResult]: Loop: 167#L606-3true assume true; 163#L606-1true assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 65#L611true assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 192#L30true assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 207#L597true main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 167#L606-3true [2018-11-10 02:24:35,109 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:35,109 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-10 02:24:35,111 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:35,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:35,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:35,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:35,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:35,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:35,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:35,200 INFO L82 PathProgramCache]: Analyzing trace with hash 34545679, now seen corresponding path program 1 times [2018-11-10 02:24:35,200 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:35,200 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:35,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:35,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:35,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:35,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:35,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:35,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:35,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1805985165, now seen corresponding path program 1 times [2018-11-10 02:24:35,224 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:35,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:35,224 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:35,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:35,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:24:35,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:35,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:24:35,430 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 42 [2018-11-10 02:24:35,479 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:24:35,480 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:24:35,480 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:24:35,480 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:24:35,480 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:24:35,481 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:35,481 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:24:35,481 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:24:35,481 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label36_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 02:24:35,481 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:24:35,481 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:24:35,505 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:35,512 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:35,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:35,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:35,565 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:35,568 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:35,570 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:35,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:35,812 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:24:35,813 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:35,822 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:35,822 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:35,842 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:35,842 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:35,845 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:35,845 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:35,850 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:35,850 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=1, ~a28~0=9} Honda state: {~a25~0=1, ~a28~0=9} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:35,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:35,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:35,890 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:35,890 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=1} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:35,893 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:35,893 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:35,906 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:35,906 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:35,923 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:35,923 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:35,973 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:35,974 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:35,982 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:35,982 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:35,985 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:35,985 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:36,011 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:36,011 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:36,016 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:36,016 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Honda state: {ULTIMATE.start_main_~input~0=4, ULTIMATE.start_main_#t~nondet2=4, ULTIMATE.start_calculate_output_~input=4, ULTIMATE.start_calculate_output_#in~input=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:36,037 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:36,037 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:36,058 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:24:36,058 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:36,088 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:24:36,089 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:24:36,089 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:24:36,089 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:24:36,089 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:24:36,089 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:24:36,090 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:36,090 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:24:36,090 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:24:36,090 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label36_true-unreach-call_false-termination.c_Iteration1_Loop [2018-11-10 02:24:36,090 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:24:36,090 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:24:36,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:36,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:36,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:36,119 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:36,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:36,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:36,125 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:36,126 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:36,302 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:24:36,307 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:24:36,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,311 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:36,313 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:36,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,323 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:36,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:36,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,330 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,331 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,332 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:24:36,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:36,335 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:36,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:36,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:36,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,363 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,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-11-10 02:24:36,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:36,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:36,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,367 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,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-11-10 02:24:36,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,368 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:36,369 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:36,369 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,372 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:36,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:36,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,373 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,374 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,375 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:36,375 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:36,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,379 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,380 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:24:36,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,381 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,381 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,381 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,382 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,391 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,393 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,393 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,400 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:24:36,400 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,403 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 02:24:36,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,418 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,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-11-10 02:24:36,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,420 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,420 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,424 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,424 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,425 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,425 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,425 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,425 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,426 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,429 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,429 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,431 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,432 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,432 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,433 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,433 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,434 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,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-11-10 02:24:36,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,435 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:36,435 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:36,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,443 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,443 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 02:24:36,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,462 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,463 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,464 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,464 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,471 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,472 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,472 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,473 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,476 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,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-11-10 02:24:36,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,477 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:24:36,477 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,478 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:24:36,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,491 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,494 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,494 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,494 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,497 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,498 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,498 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,500 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,501 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,502 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,503 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,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-11-10 02:24:36,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,504 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,504 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,508 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,509 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:36,509 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,510 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:36,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,515 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 02:24:36,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,516 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,517 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,522 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,523 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,523 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,523 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,524 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,525 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,526 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:24:36,527 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,528 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 02:24:36,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,536 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,537 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,538 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,538 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,541 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,542 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,542 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,542 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,544 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,545 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,546 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,546 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,546 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,548 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,548 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,549 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,549 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,549 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,549 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,550 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:36,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,551 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:36,551 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,551 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:24:36,551 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,558 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,558 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 02:24:36,559 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,559 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,559 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,559 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,560 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,560 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,561 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,570 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,571 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,571 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,571 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,574 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,575 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,575 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,575 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:24:36,575 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,577 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 02:24:36,577 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,599 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,599 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,600 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,600 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,600 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,601 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,601 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,603 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,604 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,604 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,604 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,605 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,607 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,607 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,607 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,608 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,608 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,610 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,611 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,611 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,611 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,611 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,611 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,612 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,612 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:36,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,613 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,613 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,614 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,614 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:36,614 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:36,614 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:36,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,619 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,619 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 02:24:36,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,619 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,620 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:36,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,620 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,621 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,621 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,632 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,634 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:36,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,634 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,635 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,637 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,638 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,638 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:36,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,638 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:24:36,638 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,641 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:24:36,641 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,663 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,664 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,664 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:36,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,664 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,664 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,664 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,665 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,668 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,669 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:36,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,670 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,670 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,673 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,674 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:36,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,674 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,674 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,677 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,678 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,678 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:36,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,678 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,679 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,680 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,681 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:36,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,681 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:36,681 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,682 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:36,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,688 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,689 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 02:24:36,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,689 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,689 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,690 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,692 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,698 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,699 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,699 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,699 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,699 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,700 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,700 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,704 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,704 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,705 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,705 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:24:36,705 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,708 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-10 02:24:36,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,737 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,738 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,738 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,738 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,738 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,740 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,745 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,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-11-10 02:24:36,746 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,746 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,746 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,747 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,747 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,751 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,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-11-10 02:24:36,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,751 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,752 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,753 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,756 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,757 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,758 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:36,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,758 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,759 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,759 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,759 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,759 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,759 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:36,759 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:36,761 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:24:36,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,769 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,769 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 02:24:36,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,770 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,770 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,771 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,777 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,778 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,778 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,779 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,779 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,779 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,781 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,781 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,781 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,782 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,782 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:24:36,782 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,783 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:24:36,783 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,797 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,798 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,798 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,798 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,799 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,799 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,803 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,803 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,803 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,803 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,804 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,804 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,806 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,806 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,806 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,806 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,806 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,807 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,807 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,807 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,809 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,809 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,809 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,809 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,810 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,810 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:36,810 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,811 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,811 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,812 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,812 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:36,812 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,812 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:36,812 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:36,813 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:36,813 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,818 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,818 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 02:24:36,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,819 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,819 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,819 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,819 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:36,821 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:36,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,843 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,843 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,844 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,844 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:36,844 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:36,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,847 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,848 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,848 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-10 02:24:36,848 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:36,850 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-10 02:24:36,851 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,904 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,904 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,904 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,904 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,904 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,905 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:36,905 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:36,906 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,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-11-10 02:24:36,914 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,914 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,914 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,914 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:36,915 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:36,915 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,922 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,922 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,922 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:36,923 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:36,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,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-11-10 02:24:36,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,926 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,926 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:36,926 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:36,927 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:36,927 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,929 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:36,929 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:36,929 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:36,929 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:36,930 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:36,930 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:36,930 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:36,931 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:24:36,931 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:36,937 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:36,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:24:36,948 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:24:36,949 INFO L87 Difference]: Start difference. First operand 227 states. Second operand 3 states. [2018-11-10 02:24:37,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:37,472 INFO L93 Difference]: Finished difference Result 381 states and 548 transitions. [2018-11-10 02:24:37,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:24:37,474 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 381 states and 548 transitions. [2018-11-10 02:24:37,478 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 372 [2018-11-10 02:24:37,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 381 states to 374 states and 541 transitions. [2018-11-10 02:24:37,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 374 [2018-11-10 02:24:37,487 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 374 [2018-11-10 02:24:37,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 374 states and 541 transitions. [2018-11-10 02:24:37,489 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:24:37,489 INFO L705 BuchiCegarLoop]: Abstraction has 374 states and 541 transitions. [2018-11-10 02:24:37,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states and 541 transitions. [2018-11-10 02:24:37,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 373. [2018-11-10 02:24:37,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-11-10 02:24:37,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 539 transitions. [2018-11-10 02:24:37,521 INFO L728 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 02:24:37,521 INFO L608 BuchiCegarLoop]: Abstraction has 373 states and 539 transitions. [2018-11-10 02:24:37,521 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 02:24:37,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 373 states and 539 transitions. [2018-11-10 02:24:37,523 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 371 [2018-11-10 02:24:37,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:37,523 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:37,524 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:24:37,524 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:37,524 INFO L793 eck$LassoCheckResult]: Stem: 751#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 632#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 633#L606-3 [2018-11-10 02:24:37,524 INFO L795 eck$LassoCheckResult]: Loop: 633#L606-3 assume true; 991#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 733#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 734#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 883#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 760#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 694#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 695#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 849#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 634#L54 assume (((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1);~a28~0 := 7;~a11~0 := 1;~a25~0 := 0;calculate_output_#res := -1; 635#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 633#L606-3 [2018-11-10 02:24:37,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:37,525 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2018-11-10 02:24:37,525 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:37,525 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:37,525 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:37,526 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:37,526 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:37,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:37,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:37,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:37,530 INFO L82 PathProgramCache]: Analyzing trace with hash -1956321088, now seen corresponding path program 1 times [2018-11-10 02:24:37,531 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:37,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:37,531 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:24:37,531 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:37,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:37,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:37,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:37,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1962170302, now seen corresponding path program 1 times [2018-11-10 02:24:37,541 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:37,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:37,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:37,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:37,542 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:24:37,569 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:37,569 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 02:24:37,650 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:24:37,650 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:24:37,650 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:24:37,650 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:24:37,650 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:24:37,650 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:37,650 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:24:37,650 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:24:37,650 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label36_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 02:24:37,650 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:24:37,651 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:24:37,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,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-11-10 02:24:37,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,772 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:24:37,772 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:37,785 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:37,785 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:37,813 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:37,813 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=8} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:37,824 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:37,824 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:37,829 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:37,829 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Honda state: {ULTIMATE.start_calculate_output_#res=-1, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:37,849 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:37,849 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:37,851 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:37,852 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=-2} Honda state: {~a19~0=-2} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:37,873 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:37,873 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:37,875 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:37,875 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:37,905 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:37,905 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:37,923 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:37,923 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=1} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:37,931 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:37,931 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:37,950 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:24:37,950 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:37,981 INFO L450 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-10 02:24:37,982 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:24:37,983 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:24:37,983 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:24:37,983 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:24:37,983 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 02:24:37,983 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:37,983 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:24:37,983 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:24:37,983 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label36_true-unreach-call_false-termination.c_Iteration2_Loop [2018-11-10 02:24:37,983 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:24:37,983 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:24:37,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,995 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:37,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:38,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:38,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:38,224 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:24:38,224 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 02:24:38,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:38,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:38,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,227 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:38,232 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:38,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,233 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,234 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,234 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:38,235 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,235 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,235 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,235 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,235 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,236 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:38,236 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:38,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,236 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,237 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,237 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:38,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:38,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,238 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,238 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,239 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:38,239 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,239 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,240 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,240 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,242 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:38,243 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,245 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 02:24:38,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 02:24:38,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,247 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,247 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 02:24:38,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,248 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,248 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:38,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,249 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,250 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,251 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:38,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,252 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,253 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,253 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,253 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,253 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,254 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,254 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:38,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,255 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,256 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,256 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:38,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,257 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,258 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,258 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,258 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,259 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,260 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,260 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,261 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,264 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,265 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,266 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:38,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,267 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,267 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 02:24:38,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,268 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,270 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,271 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,272 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,272 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,274 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,275 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,275 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,275 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:38,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,275 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,276 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,278 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,278 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,279 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,279 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,280 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,281 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,281 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,282 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:38,282 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,283 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,284 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,289 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,290 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:38,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,293 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,294 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,295 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,304 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,304 INFO L496 LassoAnalysis]: Using template '4-nested'. [2018-11-10 02:24:38,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,305 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,305 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:38,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,307 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,307 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,308 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,308 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:38,308 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,311 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,312 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,312 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,312 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:24:38,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,313 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,314 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,314 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:38,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,314 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,315 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,315 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:38,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,318 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,319 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,319 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,319 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:24:38,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,322 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,323 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,323 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,323 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:24:38,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,335 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,335 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 02:24:38,335 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,336 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,336 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:38,336 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,339 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,340 INFO L496 LassoAnalysis]: Using template '2-phase'. [2018-11-10 02:24:38,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,340 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,342 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,342 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:38,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,344 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,345 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,345 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,345 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,346 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:38,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,349 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,350 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,350 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,351 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,351 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,352 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,352 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,352 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,353 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,354 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,354 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:38,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,355 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,355 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,355 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,356 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,356 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:38,356 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,358 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,358 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,359 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,359 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,359 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,360 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,364 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,364 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,365 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,365 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,366 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,371 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,372 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,372 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,372 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,373 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 02:24:38,373 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 02:24:38,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,377 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,377 INFO L496 LassoAnalysis]: Using template '3-phase'. [2018-11-10 02:24:38,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-11-10 02:24:38,378 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,378 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:38,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,378 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,378 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,379 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,381 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,382 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:38,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,382 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,383 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,387 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,387 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,387 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,387 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:38,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,388 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,388 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,389 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:38,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,389 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,390 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:38,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,391 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,391 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,392 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,393 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,393 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:38,393 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,393 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,394 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,396 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,397 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:38,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,397 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,397 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,398 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:38,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,403 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,404 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,404 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:38,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,404 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,404 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,406 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:38,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,419 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,420 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-10 02:24:38,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,420 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,421 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,427 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,427 INFO L496 LassoAnalysis]: Using template '4-phase'. [2018-11-10 02:24:38,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,428 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,428 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,428 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,428 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,428 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,429 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:38,429 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,432 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,433 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,433 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,434 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,435 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:38,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,439 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,440 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,440 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,440 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,440 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,449 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:24:38,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,450 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,451 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,451 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,452 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:38,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,452 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,453 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,453 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,453 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,454 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:38,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,460 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,461 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,461 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,461 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,461 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,461 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,463 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:24:38,463 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,469 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,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-11-10 02:24:38,470 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,470 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,470 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,470 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,472 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-10 02:24:38,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,494 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,495 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,495 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-10 02:24:38,497 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-10 02:24:38,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,504 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,504 INFO L496 LassoAnalysis]: Using template '2-lex'. [2018-11-10 02:24:38,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,505 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,505 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,505 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,505 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,505 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,505 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,505 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,507 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,507 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,508 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,508 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,510 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,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-11-10 02:24:38,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,511 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,511 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,511 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,512 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:38,512 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,513 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,513 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,514 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,514 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,514 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,514 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,514 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,515 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,516 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,516 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,516 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,518 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,518 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,518 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,519 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,519 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,519 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:38,519 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,523 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,523 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,524 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,524 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,524 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,524 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,524 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,525 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 02:24:38,525 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,530 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,531 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,531 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-10 02:24:38,531 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,531 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 02:24:38,532 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 02:24:38,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,537 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,538 INFO L496 LassoAnalysis]: Using template '3-lex'. [2018-11-10 02:24:38,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,538 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,538 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,539 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,539 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,539 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:38,539 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,542 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,542 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,542 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,543 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:38,544 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,550 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,550 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,551 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,551 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,551 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:38,551 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:24:38,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,553 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,554 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,554 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:38,554 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,554 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,556 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,562 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,562 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:38,562 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,564 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,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-11-10 02:24:38,565 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,565 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,565 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,566 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:38,566 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:24:38,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,573 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,573 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,574 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,574 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-10 02:24:38,574 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:38,576 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 02:24:38,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,605 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-10 02:24:38,606 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-10 02:24:38,606 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-10 02:24:38,606 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 02:24:38,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 02:24:38,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 02:24:38,606 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-10 02:24:38,607 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 02:24:38,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 02:24:38,626 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 02:24:38,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:24:38,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:24:38,626 INFO L87 Difference]: Start difference. First operand 373 states and 539 transitions. cyclomatic complexity: 167 Second operand 3 states. [2018-11-10 02:24:39,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:39,040 INFO L93 Difference]: Finished difference Result 660 states and 919 transitions. [2018-11-10 02:24:39,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:24:39,041 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 660 states and 919 transitions. [2018-11-10 02:24:39,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 02:24:39,046 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 660 states to 660 states and 919 transitions. [2018-11-10 02:24:39,047 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 660 [2018-11-10 02:24:39,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 660 [2018-11-10 02:24:39,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 660 states and 919 transitions. [2018-11-10 02:24:39,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:24:39,050 INFO L705 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 02:24:39,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states and 919 transitions. [2018-11-10 02:24:39,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 660. [2018-11-10 02:24:39,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2018-11-10 02:24:39,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 919 transitions. [2018-11-10 02:24:39,066 INFO L728 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 02:24:39,067 INFO L608 BuchiCegarLoop]: Abstraction has 660 states and 919 transitions. [2018-11-10 02:24:39,067 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-10 02:24:39,067 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 660 states and 919 transitions. [2018-11-10 02:24:39,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 658 [2018-11-10 02:24:39,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:39,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:39,072 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:24:39,072 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:39,072 INFO L793 eck$LassoCheckResult]: Stem: 1792#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 1672#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 1673#L606-3 [2018-11-10 02:24:39,073 INFO L795 eck$LassoCheckResult]: Loop: 1673#L606-3 assume true; 1905#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 2176#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 2175#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 2174#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 1684#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 2200#L606-3 assume true; 1898#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 1772#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 1773#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 1926#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 1956#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 2144#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2143#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 2142#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 2139#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 2138#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 2137#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 2136#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 2134#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 2132#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 2130#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 2128#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 2126#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 2124#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 2122#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 2120#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 2118#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 2116#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 2052#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 2053#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 2201#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 2256#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 2255#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 2062#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 2063#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 2088#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 2055#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 2056#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 2135#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 2133#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 2131#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 2129#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 2127#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 2125#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 2123#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 2121#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 2119#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 2117#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 2115#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 2114#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 2113#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 2112#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 2110#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 2108#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 2106#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 1816#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 1673#L606-3 [2018-11-10 02:24:39,074 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:39,074 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2018-11-10 02:24:39,074 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:39,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:39,074 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,075 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:39,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,078 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:39,078 INFO L82 PathProgramCache]: Analyzing trace with hash 692590236, now seen corresponding path program 1 times [2018-11-10 02:24:39,078 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:39,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:39,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,079 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:24:39,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:39,165 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:24:39,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:39,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 02:24:39,166 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:24:39,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 02:24:39,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 02:24:39,167 INFO L87 Difference]: Start difference. First operand 660 states and 919 transitions. cyclomatic complexity: 260 Second operand 4 states. [2018-11-10 02:24:39,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:39,815 INFO L93 Difference]: Finished difference Result 1228 states and 1700 transitions. [2018-11-10 02:24:39,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 02:24:39,815 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1228 states and 1700 transitions. [2018-11-10 02:24:39,821 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1224 [2018-11-10 02:24:39,824 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1228 states to 1228 states and 1700 transitions. [2018-11-10 02:24:39,824 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1228 [2018-11-10 02:24:39,825 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1228 [2018-11-10 02:24:39,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1228 states and 1700 transitions. [2018-11-10 02:24:39,826 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:24:39,826 INFO L705 BuchiCegarLoop]: Abstraction has 1228 states and 1700 transitions. [2018-11-10 02:24:39,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states and 1700 transitions. [2018-11-10 02:24:39,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2018-11-10 02:24:39,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1225 states. [2018-11-10 02:24:39,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1694 transitions. [2018-11-10 02:24:39,841 INFO L728 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-10 02:24:39,841 INFO L608 BuchiCegarLoop]: Abstraction has 1225 states and 1694 transitions. [2018-11-10 02:24:39,842 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-10 02:24:39,842 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1225 states and 1694 transitions. [2018-11-10 02:24:39,845 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1221 [2018-11-10 02:24:39,846 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:39,846 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:39,847 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:24:39,847 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:39,848 INFO L793 eck$LassoCheckResult]: Stem: 3687#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 3567#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 3568#L606-3 [2018-11-10 02:24:39,848 INFO L795 eck$LassoCheckResult]: Loop: 3568#L606-3 assume true; 4365#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4363#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4361#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4359#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4357#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4355#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4353#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4306#L50 assume ~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7;~a28~0 := 11;~a25~0 := 1;calculate_output_#res := 26; 3745#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 4291#L606-3 assume true; 4290#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4289#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4288#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 3706#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3809#L606-3 assume true; 3810#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 4165#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 4164#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 4162#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 4160#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 4158#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4156#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 4154#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 4152#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 4150#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 4148#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 4146#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 4144#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 4142#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 4140#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 4138#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 4136#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 4134#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 4132#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 4130#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 4128#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 4126#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 4124#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 4122#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 4120#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 4118#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 4116#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 4114#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 4112#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 4110#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 4108#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 4106#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 4104#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 4102#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 4100#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 4098#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 4096#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 4094#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 4092#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 4090#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 4088#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 4086#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 4084#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 4082#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 4080#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 4078#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 4076#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 4074#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 4071#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 4072#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 3568#L606-3 [2018-11-10 02:24:39,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:39,848 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2018-11-10 02:24:39,848 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:39,848 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:39,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:39,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:39,853 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:39,853 INFO L82 PathProgramCache]: Analyzing trace with hash 676565178, now seen corresponding path program 1 times [2018-11-10 02:24:39,853 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:39,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:39,853 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,854 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:24:39,854 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:39,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:39,882 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 02:24:39,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:39,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:24:39,882 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:24:39,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:24:39,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:24:39,883 INFO L87 Difference]: Start difference. First operand 1225 states and 1694 transitions. cyclomatic complexity: 471 Second operand 3 states. [2018-11-10 02:24:40,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:40,207 INFO L93 Difference]: Finished difference Result 1509 states and 2003 transitions. [2018-11-10 02:24:40,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:24:40,207 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1509 states and 2003 transitions. [2018-11-10 02:24:40,215 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1505 [2018-11-10 02:24:40,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1509 states to 1509 states and 2003 transitions. [2018-11-10 02:24:40,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1509 [2018-11-10 02:24:40,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1509 [2018-11-10 02:24:40,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1509 states and 2003 transitions. [2018-11-10 02:24:40,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:24:40,224 INFO L705 BuchiCegarLoop]: Abstraction has 1509 states and 2003 transitions. [2018-11-10 02:24:40,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1509 states and 2003 transitions. [2018-11-10 02:24:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1509 to 1508. [2018-11-10 02:24:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1508 states. [2018-11-10 02:24:40,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1508 states to 1508 states and 2001 transitions. [2018-11-10 02:24:40,243 INFO L728 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-10 02:24:40,243 INFO L608 BuchiCegarLoop]: Abstraction has 1508 states and 2001 transitions. [2018-11-10 02:24:40,243 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-10 02:24:40,243 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1508 states and 2001 transitions. [2018-11-10 02:24:40,248 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 02:24:40,248 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:40,249 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:40,250 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:24:40,250 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:40,250 INFO L793 eck$LassoCheckResult]: Stem: 6430#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 6307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 6308#L606-3 [2018-11-10 02:24:40,250 INFO L795 eck$LassoCheckResult]: Loop: 6308#L606-3 assume true; 7490#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 7488#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 7486#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 7484#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6439#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 6371#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6372#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 6545#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6309#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 6310#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 6311#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 6312#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 6566#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6448#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 6449#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 7689#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 7687#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 7685#L106 assume (~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1;~a17~0 := 8;~a25~0 := 0;~a19~0 := 0;~a28~0 := 11;~a11~0 := 0;calculate_output_#res := 23; 6544#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6935#L606-3 assume true; 6933#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6931#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6929#L30 assume ((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8;~a28~0 := 9;~a11~0 := 1;~a25~0 := 1;calculate_output_#res := -1; 6410#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6937#L606-3 assume true; 6936#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 6934#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 6932#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 6930#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 6928#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 6926#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6924#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 6922#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 6920#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 6918#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 6916#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 6914#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 6912#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 6910#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 6908#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 6906#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 6904#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 6902#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 6900#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 6898#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 6896#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 6894#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 6892#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 6890#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 6888#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 6886#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 6884#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 6882#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 6880#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 6878#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 6876#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 6874#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 6872#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 6870#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 6868#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 6866#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 6864#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 6862#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 6860#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 6858#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 6856#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 6854#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 6852#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 6850#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 6848#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 6846#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 6844#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 6842#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 6838#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 6839#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 6308#L606-3 [2018-11-10 02:24:40,251 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:40,251 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2018-11-10 02:24:40,251 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:40,251 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:40,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:40,251 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:40,251 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:40,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:40,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:40,255 INFO L82 PathProgramCache]: Analyzing trace with hash 1219893882, now seen corresponding path program 1 times [2018-11-10 02:24:40,255 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:40,255 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:40,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:40,256 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:24:40,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:40,299 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-10 02:24:40,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:40,299 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:24:40,300 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:24:40,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:24:40,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:24:40,300 INFO L87 Difference]: Start difference. First operand 1508 states and 2001 transitions. cyclomatic complexity: 495 Second operand 3 states. [2018-11-10 02:24:40,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:40,702 INFO L93 Difference]: Finished difference Result 1507 states and 1821 transitions. [2018-11-10 02:24:40,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:24:40,703 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1507 states and 1821 transitions. [2018-11-10 02:24:40,707 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 02:24:40,710 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 02:24:40,710 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1507 [2018-11-10 02:24:40,711 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1507 [2018-11-10 02:24:40,711 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1507 states and 1821 transitions. [2018-11-10 02:24:40,712 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:24:40,713 INFO L705 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 02:24:40,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1507 states and 1821 transitions. [2018-11-10 02:24:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1507 to 1507. [2018-11-10 02:24:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1507 states. [2018-11-10 02:24:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1507 states to 1507 states and 1821 transitions. [2018-11-10 02:24:40,724 INFO L728 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 02:24:40,724 INFO L608 BuchiCegarLoop]: Abstraction has 1507 states and 1821 transitions. [2018-11-10 02:24:40,724 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-10 02:24:40,724 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1507 states and 1821 transitions. [2018-11-10 02:24:40,729 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 1504 [2018-11-10 02:24:40,729 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:40,729 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:40,730 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:24:40,731 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:40,731 INFO L793 eck$LassoCheckResult]: Stem: 9452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 9328#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 9329#L606-3 [2018-11-10 02:24:40,731 INFO L795 eck$LassoCheckResult]: Loop: 9329#L606-3 assume true; 9997#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9995#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9993#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9991#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9989#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9987#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9985#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9983#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9981#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9979#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9977#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9975#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9973#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9971#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9969#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9967#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9965#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9888#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9889#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 10114#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 10112#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 10110#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 10108#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 10106#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 10104#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 10102#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 10100#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 10097#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9780#L165 assume (~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1);~a25~0 := 1;~a28~0 := 9;calculate_output_#res := 26; 9671#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9773#L606-3 assume true; 9771#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 9769#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 9767#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 9765#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 9763#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 9761#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9759#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 9757#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 9755#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 9753#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 9751#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 9749#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 9747#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 9745#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 9743#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 9741#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 9739#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 9737#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 9735#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 9733#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 9731#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 9729#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 9727#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 9725#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 9723#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 9721#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 9719#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 9716#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 9714#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 9712#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 9710#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 9708#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 9706#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 9704#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 9702#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 9700#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 9698#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 9696#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 9694#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 9692#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 9690#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 9688#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 9686#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 9684#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 9682#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 9680#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 9678#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 9676#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 9673#L253 assume (~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9;~a28~0 := 7;~a17~0 := 8;~a25~0 := 0;~a11~0 := 0;calculate_output_#res := -1; 9674#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 9329#L606-3 [2018-11-10 02:24:40,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:40,731 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2018-11-10 02:24:40,731 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:40,731 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:40,732 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:40,732 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:40,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:40,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:40,736 INFO L82 PathProgramCache]: Analyzing trace with hash -606648447, now seen corresponding path program 1 times [2018-11-10 02:24:40,736 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:40,736 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:40,736 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:40,737 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 02:24:40,737 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:24:40,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:40,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 02:24:40,794 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-11-10 02:24:40,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 02:24:40,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 02:24:40,795 INFO L87 Difference]: Start difference. First operand 1507 states and 1821 transitions. cyclomatic complexity: 316 Second operand 3 states. [2018-11-10 02:24:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:40,970 INFO L93 Difference]: Finished difference Result 1496 states and 1777 transitions. [2018-11-10 02:24:40,972 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 02:24:40,972 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1496 states and 1777 transitions. [2018-11-10 02:24:40,976 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 02:24:40,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 02:24:40,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1496 [2018-11-10 02:24:40,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1496 [2018-11-10 02:24:40,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1496 states and 1777 transitions. [2018-11-10 02:24:40,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:24:40,982 INFO L705 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 02:24:40,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1496 states and 1777 transitions. [2018-11-10 02:24:40,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1496 to 1496. [2018-11-10 02:24:40,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1496 states. [2018-11-10 02:24:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1496 states to 1496 states and 1777 transitions. [2018-11-10 02:24:40,993 INFO L728 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 02:24:40,993 INFO L608 BuchiCegarLoop]: Abstraction has 1496 states and 1777 transitions. [2018-11-10 02:24:40,993 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-10 02:24:40,993 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1496 states and 1777 transitions. [2018-11-10 02:24:40,996 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1493 [2018-11-10 02:24:40,997 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:40,997 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:40,997 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-10 02:24:40,997 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:40,998 INFO L793 eck$LassoCheckResult]: Stem: 12455#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 12337#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 12338#L606-3 [2018-11-10 02:24:40,998 INFO L795 eck$LassoCheckResult]: Loop: 12338#L606-3 assume true; 13009#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 13007#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 13005#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 13003#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 13001#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 12999#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 12997#L47 assume !(((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10); 12995#L50 assume !(~a19~0 == 1 && !(~a25~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 1 && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a28~0 == 7); 12993#L54 assume !((((!(~a19~0 == 1) && calculate_output_~input == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12991#L59 assume !(~a19~0 == 1 && (((calculate_output_~input == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1)))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a17~0 == 9); 12989#L65 assume !(~a19~0 == 1 && (~a17~0 == 8 && (calculate_output_~input == 6 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a11~0 == 1)) && ~a21~0 == 1); 12987#L69 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && !(~a19~0 == 1)) && ~a17~0 == 8); 12985#L74 assume !(!(~a19~0 == 1) && (((~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a21~0 == 1); 12983#L82 assume !(((!(~a19~0 == 1) && ~a21~0 == 1 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (~a28~0 == 7 && !(~a25~0 == 1))) && calculate_output_~input == 4) && !(~a11~0 == 1)) && ~a17~0 == 8); 12981#L91 assume !(~a17~0 == 8 && ~a21~0 == 1 && ~a25~0 == 1 && ~a19~0 == 1 && !(~a11~0 == 1) && ~a28~0 == 11 && calculate_output_~input == 3); 12979#L95 assume !(~a28~0 == 9 && ((!(~a19~0 == 1) && (calculate_output_~input == 3 && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1); 12977#L99 assume !((!(~a11~0 == 1) && (~a28~0 == 11 && ~a25~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a21~0 == 1); 12975#L106 assume !((~a11~0 == 1 && ((((~a25~0 == 1 && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7)) && calculate_output_~input == 6) && ~a19~0 == 1) && ~a17~0 == 9) && ~a21~0 == 1); 12973#L113 assume !(~a17~0 == 8 && ~a21~0 == 1 && !(~a11~0 == 1) && !(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3); 12971#L119 assume !((((~a21~0 == 1 && ~a28~0 == 10 && calculate_output_~input == 1 && ~a25~0 == 1) && !(~a11~0 == 1)) && ~a17~0 == 8) && !(~a19~0 == 1)); 12969#L123 assume !(!(~a11~0 == 1) && !(~a19~0 == 1) && (~a17~0 == 8 && calculate_output_~input == 6 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a28~0 == 8 && ~a25~0 == 1))) && ~a21~0 == 1); 12967#L130 assume !(((~a17~0 == 8 && !(~a19~0 == 1) && (calculate_output_~input == 6 && ~a21~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 9); 12965#L134 assume !(!(~a11~0 == 1) && (!(~a25~0 == 1) && (~a21~0 == 1 && calculate_output_~input == 1 && ~a19~0 == 1) && ~a17~0 == 8) && ~a28~0 == 11); 12963#L139 assume !((~a11~0 == 1 && (~a19~0 == 1 && ~a21~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 4) && ~a17~0 == 9) && ~a28~0 == 9); 12961#L143 assume !((!(~a11~0 == 1) && ~a28~0 == 9 && ((!(~a19~0 == 1) && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12959#L148 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && (((~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7)) || (~a28~0 == 8 && ~a25~0 == 1)) && calculate_output_~input == 3) && !(~a19~0 == 1)) && ~a21~0 == 1); 12957#L154 assume !(~a21~0 == 1 && !(~a19~0 == 1) && ((calculate_output_~input == 5 && ((~a28~0 == 8 && ~a25~0 == 1) || (~a25~0 == 1 && ~a28~0 == 7) || (!(~a25~0 == 1) && ~a28~0 == 7))) && !(~a11~0 == 1)) && ~a17~0 == 8); 12955#L159 assume !((~a17~0 == 9 && (~a28~0 == 8 && (calculate_output_~input == 1 && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a11~0 == 1) && ~a21~0 == 1); 12852#L165 assume !((~a21~0 == 1 && ~a19~0 == 1 && ~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && calculate_output_~input == 3) && !(~a11~0 == 1)); 12853#L169 assume !(~a28~0 == 11 && (~a17~0 == 8 && ((calculate_output_~input == 6 && ~a21~0 == 1) && ~a19~0 == 1) && !(~a25~0 == 1)) && !(~a11~0 == 1)); 13625#L175 assume !((!(~a11~0 == 1) && (~a17~0 == 8 && ~a21~0 == 1 && calculate_output_~input == 3 && ~a28~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 13623#L179 assume !((~a21~0 == 1 && (~a19~0 == 1 && (((~a25~0 == 1 && ~a28~0 == 7) || (~a28~0 == 7 && !(~a25~0 == 1))) || (~a25~0 == 1 && ~a28~0 == 8)) && calculate_output_~input == 4) && ~a11~0 == 1) && ~a17~0 == 9); 13621#L185 assume !(((!(~a11~0 == 1) && ~a17~0 == 8 && (calculate_output_~input == 4 && ~a19~0 == 1) && ~a28~0 == 8) && ~a21~0 == 1) && ~a25~0 == 1); 13619#L187 assume !(~a19~0 == 1 && ((((calculate_output_~input == 4 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 13617#L189 assume !(~a17~0 == 8 && ((((calculate_output_~input == 1 && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a19~0 == 1) && !(~a25~0 == 1)) && ~a28~0 == 9); 13615#L191 assume !((((((calculate_output_~input == 4 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8) && ~a28~0 == 10) && ~a19~0 == 1); 13613#L194 assume !((!(~a25~0 == 1) && ~a11~0 == 1 && ~a28~0 == 8 && (~a17~0 == 9 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a21~0 == 1); 13611#L198 assume !(!(~a19~0 == 1) && ~a17~0 == 8 && ~a28~0 == 10 && (~a25~0 == 1 && !(~a11~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1); 13609#L202 assume !((((~a21~0 == 1 && calculate_output_~input == 1 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a17~0 == 8) && !(~a11~0 == 1)) && ~a19~0 == 1); 13607#L212 assume !(~a21~0 == 1 && ((~a19~0 == 1 && ~a25~0 == 1 && ~a28~0 == 11 && calculate_output_~input == 6) && !(~a11~0 == 1)) && ~a17~0 == 8); 13605#L215 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && ~a28~0 == 10 && (((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 13603#L218 assume !((((~a17~0 == 9 && ((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 6) && ~a11~0 == 1) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 9); 13601#L223 assume !((~a17~0 == 8 && (((calculate_output_~input == 6 && ~a25~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a21~0 == 1); 13598#L225 assume !((!(~a19~0 == 1) && ~a17~0 == 8 && !(~a11~0 == 1) && calculate_output_~input == 1 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1); 13595#L232 assume !((((((calculate_output_~input == 1 && ~a21~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && !(~a25~0 == 1)) && ~a17~0 == 8) && !(~a11~0 == 1)); 12851#L234 assume !(~a17~0 == 8 && ((!(~a11~0 == 1) && (!(~a25~0 == 1) && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 7) && ~a21~0 == 1); 12424#L237 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && (((!(~a25~0 == 1) && ~a28~0 == 11) || (!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) && calculate_output_~input == 3) && ~a21~0 == 1) && !(~a19~0 == 1)); 12425#L248 assume !((((!(~a11~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a19~0 == 1)) && ~a17~0 == 8); 12426#L253 assume !((~a17~0 == 9 && (((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a11~0 == 1) && ~a21~0 == 1) && ~a19~0 == 1) && ~a28~0 == 9); 12427#L259 assume !(!(~a11~0 == 1) && ~a19~0 == 1 && (((~a28~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)); 12428#L261 assume !(~a17~0 == 9 && ~a21~0 == 1 && ~a11~0 == 1 && (calculate_output_~input == 3 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a19~0 == 1); 12602#L276 assume !(~a28~0 == 7 && ~a17~0 == 8 && !(~a25~0 == 1) && ~a21~0 == 1 && ~a19~0 == 1 && calculate_output_~input == 5 && !(~a11~0 == 1)); 12505#L280 assume !(~a28~0 == 8 && ~a21~0 == 1 && (!(~a11~0 == 1) && (calculate_output_~input == 1 && ~a17~0 == 8) && ~a19~0 == 1) && ~a25~0 == 1); 12506#L283 assume !((((~a17~0 == 8 && (calculate_output_~input == 6 && (~a25~0 == 1 || !(~a25~0 == 1))) && ~a21~0 == 1) && ~a28~0 == 10) && !(~a11~0 == 1)) && ~a19~0 == 1); 12447#L286 assume !((!(~a11~0 == 1) && (!(~a19~0 == 1) && ((!(~a25~0 == 1) && ~a28~0 == 11) || (~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1); 12448#L291 assume !(~a17~0 == 8 && (~a21~0 == 1 && !(~a11~0 == 1) && ~a25~0 == 1 && ~a28~0 == 8 && calculate_output_~input == 6) && ~a19~0 == 1); 12507#L293 assume !((~a19~0 == 1 && ~a17~0 == 8 && ((!(~a25~0 == 1) && calculate_output_~input == 5) && ~a21~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11); 12451#L297 assume !(~a11~0 == 1 && (~a17~0 == 9 && ~a28~0 == 9 && ~a19~0 == 1 && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 5) && ~a21~0 == 1); 12452#L309 assume !((((((calculate_output_~input == 3 && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a28~0 == 11) && !(~a11~0 == 1)); 12429#L314 assume !(~a19~0 == 1 && ~a21~0 == 1 && ((calculate_output_~input == 5 && ((~a25~0 == 1 && ~a28~0 == 8) || (~a28~0 == 7 && ~a25~0 == 1) || (!(~a25~0 == 1) && ~a28~0 == 7))) && ~a11~0 == 1) && ~a17~0 == 9); 12402#L328 assume !((~a19~0 == 1 && ((!(~a11~0 == 1) && (~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a28~0 == 10) && ~a21~0 == 1) && ~a17~0 == 8); 12403#L331 assume !((!(~a11~0 == 1) && (((calculate_output_~input == 4 && ~a17~0 == 8) && !(~a25~0 == 1)) && ~a21~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1); 12534#L337 assume !(((!(~a19~0 == 1) && (calculate_output_~input == 4 && (((!(~a25~0 == 1) && ~a28~0 == 10) || (~a28~0 == 11 && ~a25~0 == 1)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12535#L349 assume !(!(~a11~0 == 1) && (~a17~0 == 8 && ((~a25~0 == 1 && calculate_output_~input == 4) && ~a19~0 == 1) && ~a28~0 == 11) && ~a21~0 == 1); 12512#L354 assume !((((~a21~0 == 1 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a28~0 == 9 && ~a25~0 == 1)) && calculate_output_~input == 6) && !(~a11~0 == 1)) && !(~a19~0 == 1)) && ~a17~0 == 8); 12398#L361 assume !(~a19~0 == 1 && ((~a21~0 == 1 && (!(~a25~0 == 1) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a28~0 == 8) && ~a11~0 == 1); 12399#L368 assume !(~a17~0 == 8 && (~a21~0 == 1 && (calculate_output_~input == 5 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a28~0 == 9 && ~a25~0 == 1))) && ~a19~0 == 1) && !(~a11~0 == 1)); 12508#L375 assume !(~a19~0 == 1 && (((~a17~0 == 8 && calculate_output_~input == 5 && !(~a11~0 == 1)) && ~a21~0 == 1) && ~a25~0 == 1) && ~a28~0 == 8); 12390#L378 assume !(((!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 4) && ~a28~0 == 10) && ~a17~0 == 8) && !(~a19~0 == 1)) && ~a25~0 == 1); 12391#L380 assume !(~a28~0 == 8 && (~a19~0 == 1 && ~a11~0 == 1 && !(~a25~0 == 1) && ~a17~0 == 9 && calculate_output_~input == 6) && ~a21~0 == 1); 12388#L389 assume !(!(~a11~0 == 1) && ((~a21~0 == 1 && calculate_output_~input == 6 && (((~a28~0 == 10 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 11)) || (!(~a25~0 == 1) && ~a28~0 == 11))) && ~a17~0 == 8) && !(~a19~0 == 1)); 12389#L394 assume !(((((!(~a25~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 3) && ~a28~0 == 9) && ~a21~0 == 1) && ~a17~0 == 8) && !(~a11~0 == 1)); 12511#L398 assume !((~a17~0 == 8 && ((calculate_output_~input == 4 && ((~a28~0 == 8 && !(~a25~0 == 1)) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && !(~a19~0 == 1)) && !(~a11~0 == 1)); 12419#L402 assume !(((!(~a11~0 == 1) && ((~a19~0 == 1 && calculate_output_~input == 5) && ~a17~0 == 8) && ~a21~0 == 1) && ~a28~0 == 9) && !(~a25~0 == 1)); 12420#L404 assume !((~a11~0 == 1 && ~a19~0 == 1 && ~a21~0 == 1 && (~a17~0 == 9 && calculate_output_~input == 5) && !(~a25~0 == 1)) && ~a28~0 == 8); 12469#L407 assume !(!(~a11~0 == 1) && ~a21~0 == 1 && (~a19~0 == 1 && ~a17~0 == 8 && ~a25~0 == 1 && calculate_output_~input == 5) && ~a28~0 == 11); 12470#L409 assume !(~a19~0 == 1 && ~a17~0 == 8 && ((((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9)) && calculate_output_~input == 3) && !(~a11~0 == 1)) && ~a21~0 == 1); 12510#L414 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12531#L414-2 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12357#L417-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12358#L420-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12503#L423-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12504#L426-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 12605#L429-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13634#L432-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13633#L435-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12354#L438-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 12550#L441-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 12551#L444-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13631#L447-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13630#L450-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13131#L453-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13105#L456-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13104#L459-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13102#L462-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13100#L465-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13097#L468-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13095#L471-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13093#L474-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13091#L477-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13089#L480-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13087#L483-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13085#L486-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13083#L489-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13081#L492-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13079#L495-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13077#L498-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13075#L501-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13073#L504-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13071#L507-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 8) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13069#L510-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13067#L513-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 12486#L516-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13064#L519-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13062#L522-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 8) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13060#L525-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13058#L528-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13056#L531-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13054#L534-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13052#L537-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13050#L540-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13048#L543-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13046#L546-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13044#L549-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13042#L552-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13040#L555-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13038#L558-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13036#L561-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 11) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13034#L564-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13032#L567-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13030#L570-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13028#L573-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 7) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13026#L576-1 assume !(((((!(~a25~0 == 1) && !(~a11~0 == 1)) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13024#L579-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 8); 13022#L582-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 8); 13020#L585-1 assume !(((((~a25~0 == 1 && ~a11~0 == 1) && ~a28~0 == 11) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13018#L588-1 assume !(((((!(~a25~0 == 1) && ~a11~0 == 1) && ~a28~0 == 10) && ~a19~0 == 1) && ~a21~0 == 1) && ~a17~0 == 7); 13016#L591-1 assume !(((((~a25~0 == 1 && !(~a11~0 == 1)) && ~a28~0 == 9) && !(~a19~0 == 1)) && ~a21~0 == 1) && ~a17~0 == 7); 13014#L594-1 calculate_output_#res := -2; 13012#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 12338#L606-3 [2018-11-10 02:24:40,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:40,999 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2018-11-10 02:24:40,999 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:40,999 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:40,999 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:40,999 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:41,000 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:41,004 INFO L82 PathProgramCache]: Analyzing trace with hash 245249823, now seen corresponding path program 1 times [2018-11-10 02:24:41,004 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:41,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:41,005 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:41,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:41,042 INFO L82 PathProgramCache]: Analyzing trace with hash -2003304803, now seen corresponding path program 1 times [2018-11-10 02:24:41,042 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:41,042 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:41,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,043 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:41,043 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:41,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 02:24:41,351 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 02:24:41,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 02:24:41,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-11-10 02:24:41,981 WARN L179 SmtUtils]: Spent 614.00 ms on a formula simplification. DAG size of input: 218 DAG size of output: 69 [2018-11-10 02:24:42,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-10 02:24:42,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-11-10 02:24:42,060 INFO L87 Difference]: Start difference. First operand 1496 states and 1777 transitions. cyclomatic complexity: 284 Second operand 10 states. [2018-11-10 02:24:42,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 02:24:42,956 INFO L93 Difference]: Finished difference Result 1688 states and 1966 transitions. [2018-11-10 02:24:42,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 02:24:42,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1688 states and 1966 transitions. [2018-11-10 02:24:42,962 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 1632 [2018-11-10 02:24:42,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1688 states to 1688 states and 1966 transitions. [2018-11-10 02:24:42,969 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1688 [2018-11-10 02:24:42,970 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1688 [2018-11-10 02:24:42,970 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1688 states and 1966 transitions. [2018-11-10 02:24:42,972 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 02:24:42,972 INFO L705 BuchiCegarLoop]: Abstraction has 1688 states and 1966 transitions. [2018-11-10 02:24:42,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states and 1966 transitions. [2018-11-10 02:24:42,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1546. [2018-11-10 02:24:42,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1546 states. [2018-11-10 02:24:42,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1546 states to 1546 states and 1824 transitions. [2018-11-10 02:24:42,994 INFO L728 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 02:24:42,994 INFO L608 BuchiCegarLoop]: Abstraction has 1546 states and 1824 transitions. [2018-11-10 02:24:42,994 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-10 02:24:42,994 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1546 states and 1824 transitions. [2018-11-10 02:24:42,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1490 [2018-11-10 02:24:42,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 02:24:42,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 02:24:43,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:43,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 02:24:43,000 INFO L793 eck$LassoCheckResult]: Stem: 15663#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~a~0 := 1;~e~0 := 5;~d~0 := 4;~f~0 := 6;~c~0 := 3;~u~0 := 21;~v~0 := 22;~w~0 := 23;~x~0 := 24;~y~0 := 25;~z~0 := 26;~a25~0 := 0;~a11~0 := 0;~a28~0 := 7;~a19~0 := 1;~a21~0 := 1;~a17~0 := 8; 15546#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet2, main_#t~ret3, main_~input~0, main_~output~0;main_~output~0 := -1; 15547#L606-3 assume true; 16354#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16352#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16350#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16348#L35 assume ~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1);~a28~0 := 10;calculate_output_#res := 22; 15803#L597 [2018-11-10 02:24:43,000 INFO L795 eck$LassoCheckResult]: Loop: 15803#L597 main_#t~ret3 := calculate_output_#res;assume { :end_inline_calculate_output } true;main_~output~0 := main_#t~ret3;havoc main_#t~ret3; 16276#L606-3 assume true; 16274#L606-1 assume !false;havoc main_~input~0;main_~input~0 := main_#t~nondet2;havoc main_#t~nondet2; 16272#L611 assume !((((main_~input~0 != 1 && main_~input~0 != 3) && main_~input~0 != 4) && main_~input~0 != 5) && main_~input~0 != 6);assume { :begin_inline_calculate_output } true;calculate_output_#in~input := main_~input~0;havoc calculate_output_#res;havoc calculate_output_~input;calculate_output_~input := calculate_output_#in~input; 16270#L30 assume !(((!(~a11~0 == 1) && ~a19~0 == 1 && calculate_output_~input == 4 && ((!(~a25~0 == 1) && ~a28~0 == 8) || (~a25~0 == 1 && ~a28~0 == 9))) && ~a21~0 == 1) && ~a17~0 == 8); 16268#L35 assume !(~a17~0 == 8 && (((!(~a11~0 == 1) && ~a21~0 == 1 && calculate_output_~input == 6) && ~a28~0 == 7) && ~a19~0 == 1) && !(~a25~0 == 1)); 16266#L38 assume !(~a21~0 == 1 && ~a19~0 == 1 && ((((~a25~0 == 1 || !(~a25~0 == 1)) && calculate_output_~input == 3) && ~a17~0 == 9) && ~a11~0 == 1) && ~a28~0 == 9); 16264#L42 assume !(~a28~0 == 9 && !(~a19~0 == 1) && ~a21~0 == 1 && ((calculate_output_~input == 4 && !(~a25~0 == 1)) && !(~a11~0 == 1)) && ~a17~0 == 8); 16262#L47 assume ((~a17~0 == 8 && ((calculate_output_~input == 1 && (~a25~0 == 1 || !(~a25~0 == 1))) && !(~a11~0 == 1)) && ~a19~0 == 1) && ~a21~0 == 1) && ~a28~0 == 10;~a25~0 := 0;calculate_output_#res := -1; 15803#L597 [2018-11-10 02:24:43,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:43,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1805984299, now seen corresponding path program 1 times [2018-11-10 02:24:43,001 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:43,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:43,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:43,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:43,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:43,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:43,007 INFO L82 PathProgramCache]: Analyzing trace with hash -278812021, now seen corresponding path program 1 times [2018-11-10 02:24:43,007 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:43,007 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:43,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:43,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:43,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 02:24:43,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1569761375, now seen corresponding path program 1 times [2018-11-10 02:24:43,013 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 02:24:43,013 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 02:24:43,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,014 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 02:24:43,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 02:24:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:43,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 02:24:43,197 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 02:24:43,197 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 02:24:43,197 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 02:24:43,197 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 02:24:43,197 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-10 02:24:43,197 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,197 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 02:24:43,197 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 02:24:43,197 INFO L131 ssoRankerPreferences]: Filename of dumped script: Problem02_label36_true-unreach-call_false-termination.c_Iteration8_Lasso [2018-11-10 02:24:43,197 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 02:24:43,197 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 02:24:43,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,216 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,219 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,228 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,229 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,236 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-10 02:24:43,354 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 02:24:43,354 INFO L410 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,359 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,359 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,361 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,361 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~u~0=0} Honda state: {~u~0=21} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,377 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,377 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,393 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,393 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~f~0=0} Honda state: {~f~0=6} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,399 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,399 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,401 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,401 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#res=0} Honda state: {ULTIMATE.start_main_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,417 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,418 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,420 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,420 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~y~0=0} Honda state: {~y~0=25} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,436 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,439 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,439 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~z~0=0} Honda state: {~z~0=26} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,455 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,455 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,470 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,470 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a21~0=0} Honda state: {~a21~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,474 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,474 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,476 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,476 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~v~0=0} Honda state: {~v~0=22} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,492 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,493 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,508 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,509 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a~0=0} Honda state: {~a~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,513 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,513 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,529 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,529 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a17~0=0} Honda state: {~a17~0=8} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,531 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,531 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,533 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,533 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_main_#t~ret3=0} Honda state: {ULTIMATE.start_main_#t~ret3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,549 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,549 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,565 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,565 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~e~0=0} Honda state: {~e~0=5} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,567 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,567 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,583 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,583 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d~0=0} Honda state: {~d~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,586 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,586 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,589 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,589 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~w~0=0} Honda state: {~w~0=23} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,604 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,605 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,606 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,607 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a25~0=0} Honda state: {~a25~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,622 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,622 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,638 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,638 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~c~0=0} Honda state: {~c~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,641 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,641 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,661 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:24:43,661 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,856 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,856 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#in~input=0, ULTIMATE.start_calculate_output_~input=0, ULTIMATE.start_main_~input~0=0, ULTIMATE.start_main_#t~nondet2=0} Honda state: {ULTIMATE.start_calculate_output_#in~input=6, ULTIMATE.start_calculate_output_~input=6, ULTIMATE.start_main_~input~0=6, ULTIMATE.start_main_#t~nondet2=1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#in~input=4, ULTIMATE.start_calculate_output_~input=3, ULTIMATE.start_main_~input~0=5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-4, ULTIMATE.start_calculate_output_~input=-3, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}, {ULTIMATE.start_calculate_output_#in~input=-5, ULTIMATE.start_calculate_output_~input=-5, ULTIMATE.start_main_~input~0=-5, ULTIMATE.start_main_#t~nondet2=0}] Lambdas: [1, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,872 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,872 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:43,874 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:43,874 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~x~0=0} Honda state: {~x~0=24} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,890 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:43,890 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:43,908 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-10 02:24:43,908 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:44,056 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:44,056 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=0} Honda state: {ULTIMATE.start_calculate_output_#res=22, ULTIMATE.start_main_~output~0=-1} Generalized eigenvectors: [{ULTIMATE.start_calculate_output_#res=-23, ULTIMATE.start_main_~output~0=22}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=-23}, {ULTIMATE.start_calculate_output_#res=0, ULTIMATE.start_main_~output~0=24}] Lambdas: [0, 0, 0] Nus: [1, 0] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:44,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:44,073 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:44,088 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:44,088 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a19~0=0} Honda state: {~a19~0=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:44,091 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:44,091 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:44,093 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:44,093 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a11~0=0} Honda state: {~a11~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/z3 Starting monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 02:24:44,110 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-10 02:24:44,111 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-10 02:24:44,113 INFO L443 LassoAnalysis]: Proved nontermination for one component. [2018-11-10 02:24:44,113 INFO L446 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~a28~0=0} Honda state: {~a28~0=10} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2018-11-10 02:24:44,148 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 02:24:44 BoogieIcfgContainer [2018-11-10 02:24:44,149 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 02:24:44,149 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 02:24:44,149 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 02:24:44,150 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 02:24:44,150 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 02:24:34" (3/4) ... [2018-11-10 02:24:44,153 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-10 02:24:44,183 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_fe9fc3b6-a5f1-4fe8-98e0-ca4ef2eebf29/bin-2019/uautomizer/witness.graphml [2018-11-10 02:24:44,183 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 02:24:44,184 INFO L168 Benchmark]: Toolchain (without parser) took 10585.91 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 494.4 MB). Free memory was 957.5 MB in the beginning and 1.1 GB in the end (delta: -109.6 MB). Peak memory consumption was 384.8 MB. Max. memory is 11.5 GB. [2018-11-10 02:24:44,185 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 02:24:44,185 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 922.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 02:24:44,185 INFO L168 Benchmark]: Boogie Procedure Inliner took 96.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -225.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. [2018-11-10 02:24:44,186 INFO L168 Benchmark]: Boogie Preprocessor took 39.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-10 02:24:44,186 INFO L168 Benchmark]: RCFGBuilder took 883.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. [2018-11-10 02:24:44,186 INFO L168 Benchmark]: BuchiAutomizer took 9173.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 336.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -33.5 MB). Peak memory consumption was 533.6 MB. Max. memory is 11.5 GB. [2018-11-10 02:24:44,187 INFO L168 Benchmark]: Witness Printer took 34.60 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-11-10 02:24:44,188 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 354.45 ms. Allocated memory is still 1.0 GB. Free memory was 957.5 MB in the beginning and 922.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 96.53 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 922.6 MB in the beginning and 1.1 GB in the end (delta: -225.0 MB). Peak memory consumption was 18.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 39.59 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 883.37 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 110.7 MB). Peak memory consumption was 110.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 9173.88 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 336.1 MB). Free memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: -33.5 MB). Peak memory consumption was 533.6 MB. Max. memory is 11.5 GB. * Witness Printer took 34.60 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 1546 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 9.1s and 8 iterations. TraceHistogramMax:3. Analysis of lassos took 5.3s. Construction of modules took 2.4s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 7. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 147 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 1546 states and ocurred in iteration 7. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 1469 SDtfs, 3082 SDslu, 490 SDs, 0 SdLazy, 3702 SolverSat, 849 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.4s 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: 56ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 3 SupportingInvariants: 0 MotzkinApplications: 18 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 31 LassoNonterminationAnalysisSatUnbounded: 2 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.9s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - GeometricNonTerminationArgumentResult [Line: 614]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {a19=0, a17=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@4be1c285=0, a11=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1934dc09=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@4be1c285=0, a11=0, \result=22, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1934dc09=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@4be1c285=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@1934dc09=1 + sum_{k=0}^i 0, y=25 + sum_{k=0}^i 0, x=24 + sum_{k=0}^i 0, z=26 + sum_{k=0}^i 0, u=21 + sum_{k=0}^i 0, w=23 + sum_{k=0}^i 0, v=22 + sum_{k=0}^i 0, a=1 + sum_{k=0}^i 0, c=3 + sum_{k=0}^i 0, a28=10 + sum_{k=0}^i 0, \old(input)=6 + sum_{k=0}^i 4 + -4*0^k + -4*k + -5*0^k, output=-1 + sum_{k=0}^i 22*0^k + -23*0^k + -23*k*0^(k-1) + 24*0^k, a25=0 + sum_{k=0}^i 0, a21=1 + sum_{k=0}^i 0, d=4 + sum_{k=0}^i 0, e=5 + sum_{k=0}^i 0, f=6 + sum_{k=0}^i 0, input=6 + sum_{k=0}^i 5 + -5*0^k + -5*k + -5*0^k, input=6 + sum_{k=0}^i 3 + -3*0^k + -3*k + -5*0^k} - StatisticsResult: NonterminationArgumentStatistics Unbounded Execution 6GEVs Lambdas: [1, 0, 0, 0, 0, 0] Mus: [1, 0, 0, 1, 0] - NonterminatingLassoResult [Line: 29]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L7] int a= 1; [L8] int e= 5; [L9] int d= 4; [L10] int f= 6; [L11] int c= 3; [L14] int u = 21; [L15] int v = 22; [L16] int w = 23; [L17] int x = 24; [L18] int y = 25; [L19] int z = 26; [L22] int a25 = 0; [L23] int a11 = 0; [L24] int a28 = 7; [L25] int a19 = 1; [L26] int a21 = 1; [L27] int a17 = 8; [L603] int output = -1; [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND TRUE ((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1))) [L36] a28 = 10 [L37] return 22; Loop: [L614] RET, EXPR calculate_output(input) [L614] output = calculate_output(input) [L606] COND TRUE 1 [L609] int input; [L610] input = __VERIFIER_nondet_int() [L611] COND FALSE !((input != 1) && (input != 3) && (input != 4) && (input != 5) && (input != 6)) [L614] CALL calculate_output(input) [L30] COND FALSE !((((!(a11==1)&&((a19==1)&&((input==4)&&((!(a25==1)&&(a28==8))||((a25==1)&&(a28==9))))))&&(a21==1))&&(a17==8))) [L35] COND FALSE !(((a17==8)&&((((!(a11==1)&&((a21==1)&&(input==6)))&&(a28==7))&&(a19==1))&&!(a25==1)))) [L38] COND FALSE !(((a21==1)&&((a19==1)&&((((((a25==1)||!(a25==1))&&(input==3))&&(a17==9))&&(a11==1))&&(a28==9))))) [L42] COND FALSE !(((a28==9)&&(!(a19==1)&&((a21==1)&&((((input==4)&&!(a25==1))&&!(a11==1))&&(a17==8)))))) [L47] COND TRUE ((((a17==8)&&((((input==1)&&((a25==1)||!(a25==1)))&&!(a11==1))&&(a19==1)))&&(a21==1))&&(a28==10)) [L48] a25 = 0 [L49] return -1; End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...